{ "item_title" : "Algorithmic Information Theory", "item_author" : [" Gregory J. Chaitin "], "item_description" : "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.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/0/52/161/604/0521616042_b.jpg", "price_data" : { "retail_price" : "70.00", "online_price" : "70.00", "our_price" : "70.00", "club_price" : "70.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }

Overview

Customers Also Bought

Details