Algorithmic information theory
著者
書誌事項
Algorithmic information theory
（Cambridge tracts in theoretical computer science, 1）
Cambridge University Press, 1987
大学図書館所蔵 件 / 全31件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. [173]-175
Reprinted with revisions 1988. x, 178 p. ; 26 cm
内容説明・目次
内容説明
Chaitin, the inventor of algorithmic information theory, presents in this book the strongest possible version of Goedel'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.
目次
- Foreword
- Preface
- Figures
- 1. Introduction
- Part I. Formalisms for Computation: Register Machines, Exponential Diophantine Equations, and Pure LISP: 2. The arithmetization of register machines
- 3. A version of Pure LISP
- 4. The LISP interpreter EVAL
- Part II. Program Size, Halting Probabilities, Randomness, and Metamathematics: 5. Conceptual development
- 6. Program size
- 7. Randomness
- 8. Incompleteness
- 9. Conclusion
- Bibliography.
「Nielsen BookData」 より
