|
|
|
|
| LEADER |
00000cam a2200000Ia 4500 |
| 001 |
6651465 |
| 005 |
20130306141700.0 |
| 008 |
071109s2007 si b 000 0 eng d |
| 003 |
ICU |
| 015 |
|
|
|a GBA818844
|2 bnb
|
| 016 |
7 |
|
|a 014426554
|2 Uk
|
| 019 |
|
|
|a 166873458
|
| 020 |
|
|
|a 9812708952
|
| 020 |
|
|
|a 9789812708953
|
| 020 |
|
|
|a 9812708960 (pbk.)
|
| 020 |
|
|
|a 9789812708960 (pbk.)
|
| 035 |
|
|
|a (OCoLC)181068420
|z (OCoLC)166873458
|
| 035 |
|
|
|a yb988681
|
| 040 |
|
|
|a BWX
|c BWX
|d UUM
|d UKM
|d BTCTA
|d BAKER
|d YDXCP
|d HKP
|d HEBIS
|d HDC
|d OCLCO
|
| 049 |
|
|
|a CGUA
|
| 050 |
|
4 |
|a QA9.65
|b .C45 2007
|
| 082 |
0 |
4 |
|a 510.1
|2 22
|
| 100 |
1 |
|
|a Chaitin, Gregory J.
|0 http://id.loc.gov/authorities/names/n87875505
|1 http://viaf.org/viaf/22226140
|
| 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.
|
| 260 |
|
|
|a Singapore ;
|a Hackensack, NJ :
|b World Scientific,
|c c2007.
|
| 300 |
|
|
|a xix, 347 p. ;
|c 26 cm.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|0 http://id.loc.gov/vocabulary/contentTypes/txt
|
| 337 |
|
|
|a unmediated
|b n
|2 rdamedia
|0 http://id.loc.gov/vocabulary/mediaTypes/n
|
| 338 |
|
|
|a volume
|b nc
|2 rdacarrier
|0 http://id.loc.gov/vocabulary/carriers/nc
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
0 |
|t On the difficulty of computations: IEEE Transactions on Information Theory, 1970
|g 3 --
|t Information-theoretic computational complexity: IEEE Transactions on Information Theory, 1974
|g 17 --
|t Randomness and mathematical proof: Scientific American, 1975
|g 31 --
|t Godel's theorem and information: International Journal of Theoretical Physics, 1982
|g 47 --
|t Randomness in arithmetic: Scientific American, 1988
|g 65 --
|t Randomness in arithmetic and the decline & fall of reductionism in pure mathematics: Bulletin of the European Association for Theoretical Computer Science, 1993
|g 75 --
|t A century of controversy over the foundations of mathematics: Calude & Paun, Finite versus Infinite, 2000
|g 99 --
|t A century of controversy over the foundations of mathematics: Complexity, 2000
|g 129 --
|t Metamathematics and the foundations of mathematics: Bulletin of the European Association for Theoretical Computer Science, 2002
|g 153 --
|t Paradoxes of randomness: Complexity, 2002
|g 169 --
|t Two philosophical applications of algorithmic information theory: Lecture Notes in Computer Science, 2003
|g 189 --
|t On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility: Hogrebe & Bromand, Grenzen und Grenzuberschreitungen, 2004
|g 201 --
|t Leibniz, information, math & physics: Loffler & Weingartner, Wissen und Glauben, 2004
|g 227 --
|t Leibniz, randomness & the halting probability: Mathematics Today, 2004
|g 241 --
|t Complexity & Leibniz: Academie Internationale de Philosophie des Sciences, Tenerife, 2005
|g 247 --
|t The limits of reason: Scientific American, 2006
|g 251 --
|t How real are real numbers?: International Journal of Bifurcation and Chaos, 2006
|g 267 --
|t Epistemology as information theory: From Leibniz to [Omega]: Collapse: Journal of Philosophical Research and Development, 2006
|g 281 --
|t Is incompleteness a serious problem?: Lolli & Pagallo, La complessita di Godel, 2007
|g 299 --
|t Speculations on biology, information & complexity: Bulletin of the European Association for Theoretical Computer Science, 2007
|g 303 --
|t How much information can there be in a real number?: International Journal of Bifurcation and Chaos, 2007
|g 313 --
|t The halting probability [Omega]: Irreducible complexity in pure mathematics: Milan Journal of Mathematics, 2007
|g 319 --
|t The halting probability [Omega]: Concentrated creativity: Obrist, Formulas for the Twenty-First Century, 2007
|g 333.
|
| 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 |
0 |
7 |
|a Mathematische Logik.
|2 swd
|
| 650 |
|
7 |
|a Computational complexity.
|2 fast
|0 http://id.worldcat.org/fast/fst00871991
|
| 650 |
|
7 |
|a Gödel's theorem.
|2 fast
|0 http://id.worldcat.org/fast/fst00949806
|
| 650 |
|
7 |
|a Incompleteness theorems.
|2 fast
|0 http://id.worldcat.org/fast/fst00968811
|
| 650 |
|
7 |
|a Logic, Symbolic and mathematical.
|2 fast
|0 http://id.worldcat.org/fast/fst01002068
|
| 650 |
|
7 |
|a Metamathematics.
|2 fast
|0 http://id.worldcat.org/fast/fst01018261
|
| 903 |
|
|
|a HeVa
|
| 929 |
|
|
|a cat
|
| 999 |
f |
f |
|i a33330cf-a1ad-5f85-b787-3eacd3e6e924
|s 78f16087-0e99-5001-8ba9-eff8389e3243
|
| 928 |
|
|
|t Library of Congress classification
|a QA267.7 .C43 2007
|l Eck
|c Eck-Eck
|i 5275903
|
| 927 |
|
|
|t Library of Congress classification
|a QA267.7 .C43 2007
|l Eck
|c Eck-Eck
|e VAND
|b 77145163
|i 8304492
|
