Get Free Shipping on orders over $89
Algorithmic Information Theory : Cambridge Tracts in Theoretical Computer Science - No Information Available

Algorithmic Information Theory

By: No Information Available

Paperback | 2 December 2004

At a Glance

Paperback


RRP $99.95

$89.75

10%OFF

or 4 interest-free payments of $22.44 with

 or 

Ships in 5 to 7 business days

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."
Industry Reviews
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert

More in Mathematical Theory of Computation

AI Engineering : Building Applications with Foundation Models - Chip Huyen
Discrete Mathematics for Computing : Grassroots - Peter Grossman

RRP $150.00

$117.75

21%
OFF
Mathematical Foundations of Deep Learning : Theory and Algorithms - Xiaojing Ye
Theory of Computation for Software Developers - Maxim Mozgovoy

RRP $189.00

$167.75

11%
OFF
Nonlinear Analysis for Human Movement Variability - Nicholas Stergiou

RRP $194.00

$171.75

11%
OFF
Mining Complex Networks : Advances in Applied Mathematics - Bogumi? Kami?ski
Mining Complex Networks : Advances in Applied Mathematics - Bogumi? Kami?ski
Introduction to Modern Cryptography : Revised Third Edition - Jonathan  Katz