설명
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.
책 세부 정보
형식
킨들
페이지
192 페이지
언어
영어
출판됨
12월 2, 2004
출판사
Cambridge University Press
판본
판본 2개
ISBN-10
1316268527
ISBN-13
9781316268520