Skip to content
Texas A&M University Libraries
  • MyLibrary
  • Help

Libraries Catalog

Advanced
  • Kolmogorov complexity and algo...
  • Cite this
  • Text this
  • Email this
  • Print
  • Export Record
    • Export to RefWorks
    • Export to EndNoteWeb
    • Export to EndNote
  • Permanent link
Cover Image

Kolmogorov complexity and algorithmic randomness /

Bibliographic Details
Main Authors: Shen, A. (Alexander), 1958- (Author), Uspenskiĭ, V. A. (Vladimir Andreevich) (Author), Vereshchagin, Nikolai Konstantinovich, 1958- (Author)
Format: Book
Language:English
Published: Providence, Rhode Island : American Mathematical Society, [2017]
Series:Mathematical surveys and monographs ; no. 220.
Subjects:
Kolmogorov complexity.
Computational complexity.
Information theory.
Computer science > Theory of computing > Algorithmic information theory (Kolmogorov complexity, etc.)
Mathematical logic and foundations > Computability and recursion theory > Algorithmic randomness and dimension.
Probability theory and stochastic processes > Foundations of probability theory > None of the above, but in this section.
Mathematics education > Combinatorics, graph theory, probability theory, statistics > Foundations and methodology of statistics.
  • Holdings
  • Description
  • Table of Contents
  • Similar Items
  • Staff View

Evans: Library Stacks

Holdings details from Evans: Library Stacks
Call Number: QA267.7 .S52413 2017
 
Call Number Status Get It
QA267.7 .S52413 2017 Checked out
  • howdy.tamu.edu
  • Off-Campus Access
  • Texas A&M University
  • Site Policies
  • Accessibility
  • Texas CREWS
  • Comments
  • Services Status
Loading...