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. 小美书屋 版权所有