zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Computability and randomness. (English) Zbl 1169.03034
Oxford Logic Guides 51. Oxford: Oxford University Press (ISBN 978-0-19-923076-1/hbk). xv, 433 p. £ 55.00 (2009).
The book presents recent results in algorithmic information theory. It contains the following chapters: 1. The complexity of sets; 2. The descriptive complexity of strings; 3. Martin-Löf randomness and invariants; 4. Diagonally noncomputable functions; 5. Lowness properties and $K$-triviality; 6. Some advanced computability theory; 7. Randomness and betting strategies; 8. Classes of computational complexity; 9. Higher computability and randomness. The book includes many exercises (some with solutions). Written by a researcher who contributed with significant results to the field, the treatment is mathematical rigourous, with many open problems, and an up-dated list of references. The book is suited for advanced courses and research.

03D32Algorithmic randomness and dimension
68Q30Algorithmic information theory
03-02Research monographs (mathematical logic)
68-02Research monographs (computer science)