Algorithmic information theory
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." This slim but highly original (and frequently lively) monograph brings to...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | 図書 |
| 言語: | Undetermined |
| 出版事項: |
Cambridge, UK
Cambridge University Press
2004
|
| 主題: | |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| Thư viện lưu trữ: | Trung tâm Học liệu Trường Đại học Cần Thơ |
|---|
| 要約: | 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." This slim but highly original (and frequently lively) monograph brings to mind the (related) work of Godel and of Turing; it is methodologically/stylistically idiosyncratic, and addressed to the clarification of some deeply fundamental issues"the nature of randomness and the limitations of the axiomatic method." |
|---|