KI-Beratung Beta
Vor Ort
Merkzettel Warenkorb
  • Produktbild: Algorithmic Randomness and Complexity
  • Produktbild: Algorithmic Randomness and Complexity
- 16%

Algorithmic Randomness and Complexity

Aus der Reihe Theory and Applications of Computability
16% sparen

133,99 € UVP 160,49 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

05.11.2010

Abbildungen

XXVIII, 855 p.

Verlag

Springer Us

Seitenzahl

855

Maße (L/B/H)

27,7/16,1/5,8 cm

Gewicht

1350 g

Sprache

Englisch

ISBN

978-0-387-95567-4

Beschreibung

Rezension

From the reviews:

“Develops the prerequisites to algorithmic randomness: computability theory and Kolmogorov complexity. … Studying these … one should be able to proceed in the area with confidence. A draft of the book under review has been circulating for years and the reviewer found it to be the best source when attempting to conduct research in the area … . It is advantageous for the future of the area of algorithmic randomness that these two books were published at the cusp of a period of great activity.” (Bjørn Kjos-Hanssen, Mathematical Reviews, Issue 2012 g)

“A thorough and systematic study of algorithmic randomness, this long-awaited work is an irreplaceable source of well-presented classic and new results for advanced undergraduate and graduate students, as well as researchers in the field and related areas. The book joins a select number of books in this category.” (Hector Zenil, ACM Computing Reviews, October, 2011)

Produktdetails

Einband

Gebundene Ausgabe

Erscheinungsdatum

05.11.2010

Abbildungen

XXVIII, 855 p.

Verlag

Springer Us

Seitenzahl

855

Maße (L/B/H)

27,7/16,1/5,8 cm

Gewicht

1350 g

Sprache

Englisch

ISBN

978-0-387-95567-4

Herstelleradresse

Libri GmbH
Europaallee 1
36244 Bad Hersfeld
DE

Email: gpsr@libri.de

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)
  • Produktbild: Algorithmic Randomness and Complexity
  • Produktbild: Algorithmic Randomness and Complexity
  • Background.- Preliminaries.- Computability Theory.- Kolmogorov Complexity of Finite Strings.- Relating Complexities.- Effective Reals.- Notions of Randomness.- Martin-Löf Randomness.- Other Notions of Algorithmic Randomness.- Algorithmic Randomness and Turing Reducibility.- Relative Randomness.- Measures of Relative Randomness.- Complexity and Relative Randomness for 1-Random Sets.- Randomness-Theoretic Weakness.- Lowness and Triviality for Other Randomness Notions.- Algorithmic Dimension.- Further Topics.- Strong Jump Traceability.- ? as an Operator.- Complexity of Computably Enumerable Sets.