Read Anywhere and on Any Device!

Subscribe to Read | $0.00

Join today and start reading your favorite books for Free!

Read Anywhere and on Any Device!

  • Download on iOS
  • Download on Android
  • Download on iOS

Algorithmic Information Theory

Algorithmic Information Theory

Gregory Chaitin
3.5/5 ( ratings)
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.
Language
English
Pages
192
Format
Hardcover
Publisher
Cambridge University Press
Release
October 30, 1987
ISBN
0521343062
ISBN 13
9780521343060

Algorithmic Information Theory

Gregory Chaitin
3.5/5 ( ratings)
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.
Language
English
Pages
192
Format
Hardcover
Publisher
Cambridge University Press
Release
October 30, 1987
ISBN
0521343062
ISBN 13
9780521343060

Rate this book!

Write a review?

loader