Algorithmic Information Theory (Cambridge Tracts in Theoretical Computer Science)
| Author | : | |
| Rating | : | 4.12 (673 Votes) |
| Asin | : | 0521343062 |
| Format Type | : | paperback |
| Number of Pages | : | 192 Pages |
| Publish Date | : | 2014-09-12 |
| Language | : | English |
DESCRIPTION:
The other half is concerned with encoding the halting probability as an algebraic equation in integers, a so-called exponential diophantine equation.. 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. 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
"Good book to start learning about LISP and Artificial Intelligence." according to Hex1aGood book to start learning about LISP and Artificial Intelligence. Hex1a4 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.. . 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.
"If you're interested in computability theory and computational complexity, Algorithmic Information Theory belongs on your bookshelf." AI Expert