Exploring randomness

by Chaitin, Gregory J.

Type Book

Rate 0.0 /5

Details

Files

Reviews

Download

Title Statements

Full title :Exploring randomness / Gregory J. Chaitin.

Edition Statements

Publication Date:©2001.

Publication Statements

Publisher(s):Springer
Place of Publication:London
Language:eng
Publication Date:©2001.

The Physical Object

Description:x, 164 pages ; : 25 cm.

Edition Identifiers

ISBN:1852334177, 9781852334178
oclc:ocm45263954
LC Classification:QA267
Dewey Decimal:511.3

Machine derived contents note: Introduction: Historical Introduction. What is LISP? Why do I like it? How to Program my Universal Turing Machine in LISP.- 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. The Basic Result on Relative Complexity.- Randomness: Theoretical Interlude -- What is Randomness? My definitions. Proof that Martin-Lf̲ Randomness is Equivalent to Martin-Lf̲ Randomness. Proof that Solovay Randomness is Equivalent to Strong Chaitin Randomness.- Future Work: Extending AIT to the Size of Programs for Computing Infinite Sets and to Computations with Oracles. Postscript -- Letter to a Young Reader.

Subjects

Algorithmus Complexité de calcul (Informatique) Computational complexity Informationstheorie LISP LISP (Computer program language) LISP (Langage de programmation) Lógica matemática Machine Theory Stochastischer Prozess Théorie des automates Zufall