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

Algorithmic Randomness and Complexity

Aus der Reihe Theory and Applications of Computability
10% sparen

104,99 € UVP 117,69 €

inkl. gesetzl. MwSt., Versandkostenfrei

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

23.08.2016

Abbildungen

XXVIII, 855 p.

Verlag

Springer Us

Seitenzahl

855

Maße (L/B/H)

23,5/15,5/4,8 cm

Gewicht

1311 g

Auflage

Softcover reprint of the original 1st ed. 2010

Sprache

Englisch

ISBN

978-1-4939-3820-9

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

Taschenbuch

Erscheinungsdatum

23.08.2016

Abbildungen

XXVIII, 855 p.

Verlag

Springer Us

Seitenzahl

855

Maße (L/B/H)

23,5/15,5/4,8 cm

Gewicht

1311 g

Auflage

Softcover reprint of the original 1st ed. 2010

Sprache

Englisch

ISBN

978-1-4939-3820-9

Herstelleradresse

Springer-Verlag KG
Sachsenplatz 4-6
1201 Wien
AT

Email: ProductSafety@springernature.com

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.