Dòng Nội dung
1
Algorithmic information theory / Gregory J Chaitin
Cambridge [Cambridgeshire] ; New York : Cambridge University Press, 1987
x, 175 pages. ; 25 cm.
Ký hiệu phân loại (DDC): 006.31
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.
 Số bản sách: (1) Tài liệu số: (0)
2
Thinking about Gödel and Turing : essays on complexity, 1970-2007 / Gregory J Chaitin
Hackensack, N.J : World Scientific, 2007
347 p. ; 25 cm.
Ký hiệu phân loại (DDC): 511.3
Dr Gregory Chaitin, one of the world's leading mathematicians, is best known for his discovery of the remarkable O number, a concrete example of irreducible complexity in pure mathematics which shows that mathematics is infinitely complex. In this volume, Chaitin discusses the evolution of these ideas, tracing them back to Leibniz and Borel as well as Gödel and Turing. This book contains 23 non-technical papers by Chaitin, his favorite tutorial and survey papers, including Chaitin's three Scientific American articles. These essays summarize a lifetime effort to use the notion of program-size co.
 Số bản sách: (10) Tài liệu số: (0)