Exploring RANDOMNESS
132.63 CHF
Versandkostenfrei
Lieferzeit: 21 Werktage
- Artikel-Nr.: 10380537
Beschreibung
I Introduction.- Historical introduction-A century of controversy over the foundations of mathematics.- What is LISP? Why do I like it?.- How to program my universal Turing machine in LISP.- II Program Size.- A self-delimiting Turing machine considered as a set of (program, output) pairs.- How to construct self-delimiting Turing machines: the Kraft inequality.- The connection between program-size complexity and algorithmic probability: H(x) = ? log2P(x) +O(1). Occam's razor: there are few minimum-size programs.- The basic result on relative complexity: H(y?x) = H(x,y)-H(x)+O(1).- III Randomness.- Theoretical interlude-What is randomness? My definitions.- Proof that Martin-Löf randomness is equivalent to Chaitin randomness.- Proof that Solovay randomness is equivalent to Martin-Löf randomness.- Proof that Solovay randomness is equivalent to strong Chaitin randomness.- IV Future Work.- Extending AIT to the size of programs for computing infinite sets and to computations with oracles.- Postscript-Letter to a daring young reader.
Eigenschaften
Gewicht: | 422 g |
Höhe: | 235 |
Seiten: | 164 |
Sprachen: | Englisch |
Autor: | Gregory J. Chaitin |
Bewertung
Bewertungen werden nach Überprüfung freigeschaltet.
Zuletzt angesehen