|
|
|
|
| LEADER |
00000cam a2200000Ka 4500 |
| 001 |
11170441 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
130204s2007 nju ob 001 0 eng d |
| 005 |
20240509214055.5 |
| 020 |
|
|
|a 9789812708977
|q (electronic bk.)
|
| 020 |
|
|
|a 9812708979
|q (electronic bk.)
|
| 020 |
|
|
|z 9789812708960
|
| 020 |
|
|
|z 9812708960
|
| 020 |
|
|
|z 9789812708953
|
| 020 |
|
|
|z 9812708952
|
| 035 |
|
|
|a (OCoLC)826660250
|
| 035 |
|
9 |
|a (OCLCCM-CC)826660250
|
| 040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d DEBSZ
|d MHW
|d YDXCP
|d OCLCQ
|d OCLCF
|d OCLCQ
|d AGLDB
|d OCLCQ
|d VTS
|d STF
|d LEAUB
|d AU@
|d M8D
|d UKAHL
|
| 049 |
|
|
|a MAIN
|
| 050 |
|
4 |
|a QA9.65
|b .C43 2007eb
|
| 072 |
|
7 |
|a MAT
|x 016000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT
|x 018000
|2 bisacsh
|
| 100 |
1 |
|
|a Chaitin, Gregory J.
|
| 245 |
1 |
0 |
|a Thinking about Gödel and Turing :
|b essays on complexity 1970-2007 /
|c Gregory J Chaitin ; with a foreword by Paul Davies.
|
| 246 |
3 |
0 |
|a Gödel and Turing
|
| 260 |
|
|
|a Hackensack, N.J. :
|b World Scientific,
|c ©2007.
|
| 300 |
|
|
|a 1 online resource (xix, 347 pages)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 505 |
0 |
|
|a On the Difficulty of Computations; Information-Theoretic Computational Complexity; Randomness and Mathematical Proof; Godel's Theorem and Information; Randomness in Arithmetic; Paradoxes of Randomness; Complexity and Leibniz; The Limits of Reason; How Real Are Real Numbers?; Is Incompleteness a Serious Problem?; How Much Information Can There Be in a Real Number?; and other papers.
|
| 588 |
0 |
|
|a Print version record.
|
| 520 |
|
|
|a 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.
|
| 650 |
|
0 |
|a Gödel's theorem.
|0 http://id.loc.gov/authorities/subjects/sh85055601
|
| 650 |
|
0 |
|a Incompleteness theorems.
|0 http://id.loc.gov/authorities/subjects/sh85064795
|
| 650 |
|
0 |
|a Logic, Symbolic and mathematical.
|0 http://id.loc.gov/authorities/subjects/sh85078115
|
| 650 |
|
0 |
|a Metamathematics.
|0 http://id.loc.gov/authorities/subjects/sh85084269
|
| 650 |
|
0 |
|a Computational complexity.
|0 http://id.loc.gov/authorities/subjects/sh85029473
|
| 650 |
|
7 |
|a MATHEMATICS
|x Infinity.
|2 bisacsh
|
| 650 |
|
7 |
|a MATHEMATICS
|x Logic.
|2 bisacsh
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 (OCoLC)fst00871991
|
| 650 |
|
7 |
|a Gödel's theorem.
|2 fast
|0 (OCoLC)fst00949806
|
| 650 |
|
7 |
|a Incompleteness theorems.
|2 fast
|0 (OCoLC)fst00968811
|
| 650 |
|
7 |
|a Logic, Symbolic and mathematical.
|2 fast
|0 (OCoLC)fst01002068
|
| 650 |
|
7 |
|a Metamathematics.
|2 fast
|0 (OCoLC)fst01018261
|
| 655 |
|
4 |
|a Electronic books.
|
| 655 |
|
0 |
|a Electronic books.
|
| 776 |
0 |
8 |
|i Print version:
|a Chaitin, Gregory J.
|t Thinking about Gödel and Turing.
|d Hackensack, N.J. : World Scientific, ©2007
|z 9789812708960
|w (DLC) 2008270513
|w (OCoLC)214286093
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a oclccm
|
| 999 |
f |
f |
|i 75017619-8907-5b34-a845-e8cef31f62f0
|s 7b5fcb67-3860-5399-928c-77507e04b959
|
| 928 |
|
|
|t Library of Congress classification
|a QA9.65 .C43 2007eb
|l Online
|c UC-FullText
|u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=e000xna&AN=518641
|z eBooks on EBSCOhost
|g ebooks
|i 12382746
|
