Information-theoretic Incompleteness (Series in Computer Science v. 35)
By: Gregory J. Chaitin (author)Paperback
2 - 4 weeks availability
In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a nontechnical discussion of its significance. The volume is an essential companion to the earlier collection of Chaitin's papers Information, Randomness and Incompleteness, also published by World Scientific.The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin's most fundamental information-theoretic incompleteness theorems. The nontechnical part includes the lecture given by Chaitin in Gsdel's classroom at the University of Vienna, a transcript of a BBC TV interview, and articles from New Scientist, La Recherche, and the Mathematical Intelligencer.
Part 1 Technical survey: Turing machines; blank-endmarker programs; LISP program-size complexity. Part 2 Non-technical discussions: a random walk in arithmetic; number and randomness; randomness in arithmetic. Part 3 The challenge for the future: complexity and biology. (Part Contents)
Number Of Pages:
- ID: 9789810236953
- Saver Delivery: Yes
- 1st Class Delivery: Yes
- Courier Delivery: Yes
- Store Delivery: Yes
Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly
© Copyright 2013 - 2016 WHSmith and its suppliers.
WHSmith High Street Limited Greenbridge Road, Swindon, Wiltshire, United Kingdom, SN3 3LD, VAT GB238 5548 36