Information-theoretic incompleteness
著者
書誌事項
Information-theoretic incompleteness
（Series in computer science, v. 35）
World Scientific, c1992
- pbk
大学図書館所蔵 件 / 全13件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references
First reprint 1998
内容説明・目次
内容説明
In this mathematical autobiography, Gregory Chaitin presents a technical survey of his work and a nontechnical discussion of its significance. The volume is an essential companion to the earlier collection of Chaitin's papers Information, Randomness and Incompleteness, also published by World Scientific.The technical survey contains many new results, including a detailed discussion of LISP program size and new versions of Chaitin's most fundamental information-theoretic incompleteness theorems. The nontechnical part includes the lecture given by Chaitin in Gšdel's classroom at the University of Vienna, a transcript of a BBC TV interview, and articles from New Scientist, La Recherche, and the Mathematical Intelligencer.
目次
- Part 1 Technical survey: Turing machines
- blank-endmarker programs
- LISP program-size complexity. Part 2 Non-technical discussions: a random walk in arithmetic
- number and randomness
- randomness in arithmetic. Part 3 The challenge for the future: complexity and biology. (Part Contents)
「Nielsen BookData」 より