Items related to Algorithmic Information Theory (Cambridge Tracts in...
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Book 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.
Review
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert
"About this title" may belong to another edition of this title.
- PublisherCambridge University Press
- Publication date2004
- ISBN 10 0521616042
- ISBN 13 9780521616041
- BindingPaperback
- LanguageEnglish
- Number of pages192
- Rating
Search results for Algorithmic Information Theory (Cambridge Tracts in...
Stock Image
Algorithmic Information Theory
Published by
Cambridge University Press, UK, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
Used
Soft cover
Seller: RIVERLEE BOOKS, Waltham Cross, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Soft cover. Condition: Very Good. Very good condition soft cover, light wear to the cover and spine, ex academic library book with all the usual marks and labels, otherwise in a very good condition inside and out. Seller Inventory # 65295
Quantity: 1 available
Stock Image
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Softcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190009519
Quantity: Over 20 available
Stock Image
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Softcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521616041
Quantity: Over 20 available
Stock Image
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science, Series Number 1)
Published by
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Softcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521616041_new
Quantity: Over 20 available
Stock Image
Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)
Published by
Cambridge University Press 2008-08-21, 2008
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Paperback
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Seller Inventory # 6666-IUK-9780521616041
Quantity: 10 available
Stock Image
Algorithmic Information Theory
Published by
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Paperback / softback
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 380. Seller Inventory # C9780521616041
Quantity: Over 20 available
Stock Image
Algorithmic Information Theory
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 175 pages. 9.75x7.50x0.50 inches. In Stock. This item is printed on demand. Seller Inventory # __0521616042
Quantity: 1 available
Stock Image
Algorithmic Information Theory (Paperback)
Published by
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Paperback
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel'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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521616041
Quantity: 1 available
Stock Image
Algorithmic Information Theory (Paperback)
Published by
Cambridge University Press, Cambridge, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Paperback
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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. Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Godel'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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521616041
Quantity: 1 available
Seller Image
Algorithmic Information Theory
Published by
Cambridge University Press, 2004
ISBN 10: 0521616042
ISBN 13: 9780521616041
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Expounds G del's incompleteness theorey using an information theoretic approach based on the size of computer programs. Seller Inventory # 9780521616041
Quantity: 1 available