Algorithmic Information Theory pdf epub mobi txt 電子書 下載2025
- 計算機
- 數學
- nemlophics
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.
具體描述
讀後感
我从 amazon[评价] 的评论，看到 “Pretty much what I said in the title. If you're a student wanting to learn about LISP and/or Artificial Intelligence, this book is a good explanation of the fundamentals.”， 觉得即使看不懂啥是算法信息论，我还可以看下 Lisp ...
評分我从 amazon[评价] 的评论，看到 “Pretty much what I said in the title. If you're a student wanting to learn about LISP and/or Artificial Intelligence, this book is a good explanation of the fundamentals.”， 觉得即使看不懂啥是算法信息论，我还可以看下 Lisp ...
評分我从 amazon[评价] 的评论，看到 “Pretty much what I said in the title. If you're a student wanting to learn about LISP and/or Artificial Intelligence, this book is a good explanation of the fundamentals.”， 觉得即使看不懂啥是算法信息论，我还可以看下 Lisp ...
評分我从 amazon[评价] 的评论，看到 “Pretty much what I said in the title. If you're a student wanting to learn about LISP and/or Artificial Intelligence, this book is a good explanation of the fundamentals.”， 觉得即使看不懂啥是算法信息论，我还可以看下 Lisp ...
評分我从 amazon[评价] 的评论，看到 “Pretty much what I said in the title. If you're a student wanting to learn about LISP and/or Artificial Intelligence, this book is a good explanation of the fundamentals.”， 觉得即使看不懂啥是算法信息论，我还可以看下 Lisp ...
用戶評價
相關圖書
本站所有內容均為互聯網搜索引擎提供的公開搜索信息，本站不存儲任何數據與內容，任何內容與數據均與本站無關，如有需要請聯繫相關搜索引擎包括但不限於百度，google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美書屋 版权所有