Algorithmic Information Theory

Gregory. J. Chaitin

  • 出版商: Cambridge
  • 出版日期: 2004-12-02
  • 售價: $1,050
  • 貴賓價: 9.8$1,029
  • 語言: 英文
  • 頁數: 192
  • 裝訂: Paperback
  • ISBN: 0521616042
  • ISBN-13: 9780521616041
  • 相關分類: Algorithms-data-structures
  • 無法訂購

買這商品的人也買了...

相關主題

商品描述

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.