Code: 02037526
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 h ... more
English
You get 164 loyalty points
Book 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.
Book details
Book category Books in English Mathematics & science Mathematics Mathematical foundations
67.48 €
English
Collection points Bratislava a 12730 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25464 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )