THINKING ABOUT GODEL AND TURING: ESSAYS ON COMPLEXITY, 1970-2007 by GREGORY J CHAITIN |
Join Amazon Prime and get unlimited Free One-Day Delivery. Already a member? Sign in.
|
Customers Who Bought This Item Also Bought
Product details
Would you like to update product info or give feedback on images?
|
Customers Viewing This Page May Be Interested in These Sponsored Links(What is this?) |
Product Description
Review
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert
Product Description
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
See all Product Description
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert
Product Description
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Gödel's incompleteness theorem, using an information theoretic approach based on the size of computer programs. One half of the book is concerned with studying the halting probability of a universal computer if its program is chosen by tossing a coin. The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.
See all Product Description
Inside This Book
(Learn More)
First Sentence
More than half a century has passed since the famous papers GÖDEL (1931) and TURING (1937) that shed so much light on the foundations of mathematics, and that simultaneously promulgated mathematical formalisms for specifying algorithms, in one case via primitive recursive function definitions, and in the other case via Turing machines. Read the first page Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Back Cover
More than half a century has passed since the famous papers GÖDEL (1931) and TURING (1937) that shed so much light on the foundations of mathematics, and that simultaneously promulgated mathematical formalisms for specifying algorithms, in one case via primitive recursive function definitions, and in the other case via Turing machines. Read the first page Browse Sample Pages
Front Cover | Copyright | Table of Contents | Excerpt | Back Cover
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product)
|
Customer Reviews
There are no customer reviews yet. Create your own review
| |||
Video reviews
|
 |
Look for similar items by category
- Books > Computing & Internet > Computer Science > Architecture & Microprocessors > Architecture & Logic
- Books > Computing & Internet > Digital Lifestyle > Online Shopping > Amazon
- Books > Computing & Internet > Programming > Algorithms
- Books > Computing & Internet > Programming > Languages & Tools
- Books > Science & Nature > Mathematics > Mathematical Foundations > Mathematical Logic
- Books > Science & Nature > Popular Science > Maths
- Books > Scientific, Technical & Medical > Mathematics > Mathematical Theory > Mathematical Logic
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
The Body Shop |
Beauty without the Beast |
Up to 53% off Braun Series Shavers |
Treat Someone
With an Amazon.co.uk Gift Certificate, you can get them what they want (even if you don't know what that is). |
|||||||
| |||||
Your Recent History
(What's this?)|
You have no recently viewed items or searches.
After viewing product detail pages or search results, look here to find an easy way to navigate back to pages you are interested in. Look to the right column to find helpful suggestions for your shopping session. |
Continue Shopping: Top Sellers
| ||||
Amazon Home | |
| International Sites: United States | Germany | France | Japan | Canada | China | |
| Business Programs: Sell on Amazon | Fulfilment by Amazon | Join Associates | Join Advantage | |
| Customer Service | Help | View Basket | Your Account | |
| About Amazon.co.uk | Careers at Amazon | |
| Conditions of Use & Sale | Privacy Notice © 1996-2009, Amazon.com, Inc. and its affiliates |