UID:
almafu_9960117023602883
Format:
1 online resource (x, 175 pages) :
,
digital, PDF file(s).
ISBN:
0-511-60885-3
Series Statement:
Cambridge tracts in theoretical computer science ; 1
Content:
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.
Note:
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
,
English
Additional Edition:
ISBN 0-521-61604-2
Additional Edition:
ISBN 0-521-34306-2
Language:
English
Subjects:
Computer Science
,
Mathematics
URL:
https://doi.org/10.1017/CBO9780511608858
