Thinking about gödel and turing essays on complexity, 1970-2007

Thinking About Godel and Turing: Essays on Complexity, 1970-2007

Volumn , Issue , 2007, Pages 1-347

  Chaitin, Gregory J ^a   Davies, Paul ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84967484688     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/6536     Document Type: Book

References (303)

1. M. Davis, Ed., The Undecidable. Hewlett, N.Y.: Raven Press, 1965.
2. M. Davis, Ed., Computability and Unsolvability. New York: McGraw-Hill, 1958.
3. M. Davis, Ed., "Unsolvable problems: A review," Proc. Symp. on Mathematical Theory of Automata. Brooklyn, N.Y.: Polytech. Inst. Brooklyn Press, 1963, pp. 15-22.
4. M. Davis, Ed., "Applications of recursive function theory to number theory," Proc. Symp. in Pure Mathematics, vol. 5. Providence, R.I.: AMS, 1962, pp. 135-138.
5. M. Minsky, Computation: Finite and Infinite Machines. Englewood Clifis, N.J.: Prentice-Hall, 1967.
6. H. Rogers, Jr., Theory of Recursive Functions and Eéctive Computability. New York: McGraw-Hill, 1967.
7. M. A. Arbib, Theories of Abstract Automata. Englewood Clifis, N.J.: Prentice-Hall (to be published).
8. R. J. Solomonofi, "A formal theory of inductive inference," Inform. and Control, vol. 7, pp. 1-22, March 1964; pp. 224-254, June 1964.
9. A. N. Kolmogorov, "Three approaches to the definition of the concept ‘quantity of information’," Probl. Peredachi Inform., vol. 1, pp. 3-11, 1965.
10. A. N. Kolmogorov, Foundations of the Theory of Probability. New York: Chelsea, 1950.
11. G. J. Chaitin, "On the length of programs for computing finite binary sequences," J. ACM, vol. 13, pp. 547-569, October 1966.
12. G. J. Chaitin, "On the length of programs for computing finite binary sequences: statistical considerations," J. ACM, vol. 16, pp. 145-159, January 1969.
13. G. J. Chaitin, "On the simplicity and speed of programs for computing infinite sets of natural numbers," J. ACM, vol. 16, pp. 407-422, July 1969.
14. P. Martin-Löf, "The definition of random sequences," Inform. and Control, vol. 9, pp. 602-619, December 1966.
15. C. E. Shannon and W. Weaver, The Mathematical Theory of Communication. Urbana, Ill.: University of Illinois Press, 1949.
16. M. Blum, "A machine-independent theory of the complexity of recursive functions," J. ACM, vol. 14, pp. 322-336, April 1967.
17. M. A. Arbib and M. Blum, "Machine dependence of degrees of dićulty," Proc. AMS, vol. 16, pp. 442-447, June 1965.
18. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Oxford: Oxford University Press, 1962
19. D. G. Willis, "Computational complexity and probability constructions," Stanford University, Stanford, Calif., March 1969.
20. A. N. Kolmogorov, "Logical basis for information theory and probability theory," IEEE Trans. Information Theory, vol. IT-14, pp. 662-664, September 1968.
21. D. W. Loveland, "A variant of the Kolmogorov concept of complexity," Dept. of Math., Carnegie-Mellon University, Pittsburgh, Pa., Rept. 69-4.
22. P. R. Young, "Toward a theory of enumerations," J. ACM, vol. 16, pp. 328-348, April 1969.
23. D. E. Knuth, The Art of Computer Programming; vol. 2, Seminumerical Algorithms.Reading, Mass.: Addison-Wesley, 1969.
24. 1969 Conf. Rec. of the ACM Symp. on Theory of Computing (Marina del Rey, Calif.).
25. J. van Heijenoort, Ed., From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931. Cambridge, Mass.: Harvard Univ. Press, 1967.
26. M. Davis, Ed., The Undecidable-Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions. Hewlett, N.Y.: Raven Press, 1965.
27. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior.Princeton, N.J.: Princeton Univ. Press, 1944.
28. J. von Neumann and O. Morgenstern, "Method in the physical sciences," in John von Neumann-Collected Works.New York: Macmillan, 1963, vol. 6, no. 35.
29. J. von Neumann and O. Morgenstern, The Computer and the Brain. New Haven, Conn.: Yale Univ. Press, 1958.
30. J. von Neumann and O. Morgenstern, Theory of Self-Reproducing Automata. Urbana, Ill.: Univ. Illinois Press, 1966. (Edited and completed by A. W. Burks.)
31. R. J. Solomonofi, "A formal theory of inductive inference," Inform. Contr., vol. 7, pp. 1-22, Mar. 1964; also, pp. 224-254, June 1964.
32. A. N. Kolmogorov, "Logical basis for information theory and probability theory," IEEE Trans. Inform. Theory, vol. IT-14, pp. 662-664, Sept. 1968.
33. G. J. Chaitin, "On the dićulty of computations," IEEE Trans. Inform. Theory, vol. IT-16, pp. 5-9, Jan. 1970.
34. G. J. Chaitin, "To a mathematical definition of ‘life’," ACM SICACT News, no. 4, pp. 12-18, Jan. 1970.
35. G. J. Chaitin, "Computational complexity and Gödel’s incompleteness theorem," (Abstract) AMS Notices, vol. 17, p. 672, June 1970; (Paper) ACM SIGACT News, no. 9, pp. 11-12, Apr. 1971.
36. G. J. Chaitin, "Information-theoretic limitations of formal systems," presented at the Courant Institute Computational Complexity Symp., N.Y., Oct. 1971. A revised version will appear in J. Ass. Comput. Mach.
37. M. Kac, Statistical Independence in Probability, Analysis, and Number Theory, Carus Math. Mono., Mathematical Association of America, no. 12, 1959.
38. M. Eigen, "Selforganization of matter and the evolution of biological macromolecules," Die Naturwissenschaften, vol. 58, pp. 465-523, Oct. 1971.
39. B. Chandrasekaran and L. H. Reeker, "Artićial intelligence-a case for agnosticism," Ohio State University, Columbus, Ohio, Rep. OSU-CISRC-TR-72-9, Aug. 1972; also, IEEE Trans. Syst., Man, Cybern., vol. SMC-4, pp. 88-94, Jan. 1974.
40. H. Rogers, Jr., Theory of Recursive Functions and Eéctive Computability. New York: McGraw-Hill, 1967.
41. A Profile of Mathematical Logic. Howard DeLong. Addison-Wesley/, 1970.
42. Theories of Probability: An Examination of Foundations. Terrence L. Fine. Academic Press, 1973.
43. Universal Gambling Schemes and the Complexity Measures of Kolmogorov and Chaitin. Thomas M. Cover. Technical Report № 12, Statistics Department, Stanford University, 1974.
44. "Information-Theoretic Limitations of Formal Systems." Gregory J. Chaitin in Journal of the Association for Computing Machinery, Vol. 21, pages 403-424; July, 1974.
45. Bell, E. T. (1951). Mathematics, Queen and Servant of Science, McGraw-Hill, New York.
46. Bennett, C. H. (1982). The thermodynamics of computation-a review, International Journal of Theoretical Physics, 21, 905-940.
47. Chaitin, G. J. (1974a). Information-theoretic computational complexity, IEEE Transactions on Information Theory, IT-20, 10-15.
48. Chaitin, G. J. (1974b). Information-theoretic limitations of formal systems, Journal of the ACM, 21, 403-424.
49. Chaitin, G. J. (1975a). Randomness and mathematical proof, Scientić American, 232 (5) (May 1975), 47-52. (Also published in the French, Japanese, and Italian editions of Scientić American.)
50. Chaitin, G. J. (1975b). A theory of program size formally identical to information theory, Journal of the ACM, 22, 329-340.
51. Chaitin, G. J. (1977). Algorithmic information theory, IBM Journal of Research and Development,21, 350-359, 496.
52. Chaitin, G. J., and Schwartz, J. T. (1978). A note on Monte Carlo primality tests and algorithmic information theory, Communications on Pure and Applied Mathematics, 31, 521-527.
53. Chaitin, G. J. (1979). Toward a mathematical definition of "life," in The Maximum Entropy Formalism, R. D. Levine and M. Tribus (eds.), MIT Press, Cambridge, Massachusetts, pp. 477-498.
54. Chaitin, G. J. (1982). Algorithmic information theory, Encyclopedia of Statistical Sciences, Vol. 1, Wiley, New York, pp. 38-41.
55. Cole, C. A., Wolfram, S., et al. (1981). SMP: a symbolic manipulation program, California Institute of Technology, Pasadena, California.
56. Courant, R., and Robbins, H. (1941). What is Mathematics?, Oxford University Press, London.
57. Davis, M., Matijasević, Y., and Robinson, J. (1976). Hilbert’s tenth problem. Diophantine equations: positive aspects of a negative solution, in Mathematical Developments Arising from Hilbert Problems, Proceedings of Symposia in Pure Mathematics, Vol. XXVII, American Mathematical Society, Providence, Rhode Island, pp. 323-378.
58. Davis, M. (1978). What is a computation?, in Mathematics Today: Twelve Informal Essays, L. A. Steen (ed.), Springer-Verlag, New York, pp. 241-267.
59. Dewar, R. B. K., Schonberg, E., and Schwartz, J. T. (1981). Higher Level Programming: Introduction to the Use of the Set-Theoretic Programming Language SETL, Courant Institute of Mathematical Sciences, New York University, New York.
60. Eigen, M., and Winkler, R. (1981). Laws of the Game, Knopf, New York.
61. Einstein, A. (1944). Remarks on Bertrand Russell’s theory of knowledge, in The Philosophy of Bertrand Russell, P. A. Schilpp (ed.), Northwestern University, Evanston, Illinois, pp. 277-291.
62. Einstein, A. (1954). Ideas and Opinions, Crown, New York, pp. 18-24.
63. Feynman, A. (1965). The Character of Physical Law, MIT Press, Cambridge, Massachusetts.
64. Gardner, M. (1979). The random number bids fair to hold the mysteries of the universe, Mathematical Games Dept., Scientić American, 241 (5) (November 1979), 20-34.
65. Gödel, K. (1964). Russell’s mathematical logic, and What is Cantor’s continuum problem?, in Philosophy of Mathematics, P. Benacerraf and H. Putnam (eds.), Prentice-Hall, Englewood Clifis, New Jersey, pp. 211-232, 258-273.
66. Hofstadter, D. R. (1979). Gödel, Escher, Bach: an Eternal Golden Braid, Basic Books, New York.
67. Levin, M. (1974). Mathematical Logic for Computer Scientists, MIT Project MAC report MAC TR-131, Cambridge, Massachusetts.
68. Pólya, G. (1959). Heuristic reasoning in the theory of numbers, American Mathematical Monthly, 66, 375-384.
69. Post, E. (1965). Recursively enumerable sets of positive integers and their decision problems, in The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions, M. Davis (ed.), Raven Press, Hewlett, New York, pp. 305-337.
70. Russell, B. (1967). Mathematical logic as based on the theory of types, in From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931, J. van Heijenoort (ed.), Harvard University Press, Cambridge, Massachusetts, pp. 150-182.
71. Taub, A. H. (ed.) (1961). J. von Neumann-Collected Works, Vol. I, Pergamon Press, New York, pp. 1-9.
72. von Neumann, J. (1956). The mathematician, in The World of Mathematics, Vol.4, J. R. Newman (ed.), Simon and Schuster, New York, pp. 2053-2063.
73. von Neumann, J. (1963). The role of mathematics in the sciences and in society, and Method in the physical sciences, in J. von Neumann-Collected Works, Vol. VI, A. H. Taub (ed.), McMillan, New York, pp. 477-498.
74. von Neumann, J. (1966). Theory of Self-Reproducing Automata, A. W. Burks (ed.), University of Illinois Press, Urbana, Illinois.
75. Weyl, H. (1946). Mathematics and logic, American Mathematical Monthly, 53, 1-13.
76. Weyl, H. (1949). Philosophy of Mathematics and Natural Science, Princeton University Press, Princeton, New Jersey.
77. Wilf, H. S. (1982). The disk with the college education, American Mathematical Monthly, 89, 4-8.
78. Algorithmic Information Theory. Gregory J. Chaitin. Cambridge University Press, 1987.
79. Information, Randomness & Incompleteness. Gregory J. Chaitin. World Scientić Publishing Co. Pte. Ltd., 1987.
80. The Ultimate in Undecidability. Ian Stewart in Nature, Vol. 232, № 6160, pages 115-116; March 10, 1988.
81. G. J. Chaitin, Information-Theoretic Incompleteness, World Scientić, 1992.
82. G. J. Chaitin, Information, Randomness & Incompleteness, second edition, World Scientić, 1990.
83. G. J. Chaitin, Algorithmic Information Theory, revised third printing, Cambridge University Press, 1990.
84. G. J. Chaitin, The Unknowable, Springer-Verlag, 1999.
85. G. J. Chaitin, The Limits of Mathematics, Springer-Verlag, 1998.
86. G.J. Chaitin, Algorithmic Information Theory, Cambridge University Press, 1987.
87. G.J. Chaitin, Information, Randomness & Incompleteness, World Scientić, 1987.
88. G.J. Chaitin, Information, Randomness & Incompleteness, 2nd Ed., World Scienti ć, 1990.
89. G.J. Chaitin, Information-Theoretic Incompleteness, World Scientić, 1992.
90. G.J. Chaitin, The Limits of Mathematics, Springer-Verlag, 1998.
91. G.J. Chaitin, The Unknowable, Springer-Verlag, 1999.
92. I’ve recently finished programming my entire theory in LISP. This will eventually be my book Exploring Randomness, in preparation.
93. Jonathan Borwein, David Bailey (2002), Mathematics by Experiment, A. K. Peters. [In preparation.]
94. Cristian Calude (2002), Information and Randomness, Springer-Verlag. [In preparation.]
95. Gregory Chaitin (1975), "A theory of program size formally identical to information theory," Association for Computing Machinery Journal, vol. 22, pp. 329-340.
96. Gregory Chaitin (1987), Algorithmic Information Theory, Cambridge University Press.
97. Gregory Chaitin (1998, 1999, 2001, 2002), The Limits of Mathematics, The Unknowable, Exploring Randomness, Conversations with a Mathematician, Springer-Verlag.
98. Jean-Paul Delahaye (2002), "Les nombres oméga," Pour la Science, mai 2002, pp. 98-103.
99. Ivor Grattan-Guinness (2000), The Search for Mathematical Roots, 1870-1940, Princeton University Press.
100. Vladimir Tasić (2001), Mathematics and the Roots of Postmodern Thought, Oxford University Press.
101. Thomas Tymoczko (1998), New Directions in the Philosophy of Mathematics, Princeton University Press.
102. Douglas Lenat (1984), "Automated theory formation in mathematics," in W. W. Bledsoe, D. W. Loveland, Automated Theorem Proving: After 25 Years, American Mathematical Society, pp. 287-314.
103. David Deutsch (1997), The Fabric of Reality, Penguin.
104. Stephen Wolfram (2002), A New Kind of Science, Wolfram Media.
105. Robert Wright (1988), Three Scientists and Their Gods, Times Books. [On Edward Fredkin.]
106. Michael Nielsen, Isaac Chuang (2000), Quantum Computation and Quantum Information, Cambridge University Press.
107. Tom Siegfried (2000), The Bit and the Pendulum, Wiley. [For the work of Rolf Landauer.]
108. Lee Smolin (2001), Three Roads to Quantum Gravity, Basic Books.
109. Brian Hayes (2002), "The easiest hard problem," American Scientist, vol. 90, pp. 113-117.
110. John von Neumann (1966), Theory of Self-Reproducing Automata, edited and completed by Arthur Burks, University of Illinois Press.
111. Gregory Chaitin (1970, 1979), "To a mathematical definition of ‘life’," ACM SICACT News, January 1970, pp. 12-18
112. "Toward a mathematical definition of ‘life’," in R. D. Levine, M. Tribus, The Maximum Entropy Formalism, Massachusetts Institute of Technology Press, pp. 477-498.
113. John Maynard Smith, Eörs Szathmfiary (1999), The Origins of Life, Oxford University Press.
114. Lily Kay (2000), Who Wrote the Book of Life?, Stanford University Press. [On information theory and molecular biology.]
115. Tor Nfirretranders (1998), The User Illusion, Viking. [On information theory and psychology.]
116. J. Borwein, D. Bailey, Mathematics by Experiment, A. K. Peters, to appear.
117. C. Calude, Information and Randomness, Springer-Verlag, 2002.
118. G. J. Chaitin, "Information-theoretic computational complexity," IEEE Information Theory Transactions, 1974, pp. 10-15.
119. G. J. Chaitin, "Randomness and mathematical proof," "Randomness in arithmetic," Scientić American, May 1975, July 1988, pp. 47-52, 80-85.
120. G. J. Chaitin, The Limits of Mathematics, The Unknowable, Exploring Randomness, Conversations with a Mathematician, Springer-Verlag, 1998, 1999, 2001, 2002.
121. M. Chown, "Smash and grab," New Scientist, 6 April 2002, pp. 24-28.
122. J.-P. Delahaye, "Les nombres oméga," Pour la Science, May 2002, pp. 98-103.
123. G. Polya, How to Solve It, Princeton University Press, 1988.
124. J. Rosenblum, J. S. Lessner, Fermat’s Last Tango, Original Cast Records OC-6010, 2001.
125. S. Singh, Fermat’s Enigma, Walker and Co., 1997.
126. V. Tasić, Mathematics and the Roots of Postmodern Thought, Oxford University Press, 2001.
127. T. Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
128. D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, 1986.
129. S. Wolfram, A New Kind of Science, Wolfram Media, 2002.
130. O. Postel-Vinay, "L’Univers est-il un calculateur?" [Is the universe a calculator?], La Recherche, no. 360, January 2003, pp. 33-44.
131. S. Wolfram, A New Kind of Science, Wolfram Media, 2002.
132. Leibniz, Discours de métaphysique, Gallimard, 1995.
133. G. W. Leibniz, Philosophical Essays, Hackett, 1989.
134. H. Weyl, The Open World, Yale University Press, 1932, Ox Bow Press, 1989.
135. B. Magee, Confessions of a Philosopher, Modern Library, 1999.
136. J. R. Brown, Philosophy of Mathematics, Routledge, 1999.
137. G. J. Chaitin, "Paradoxes of randomness," Complexity, vol. 7, no. 5, pp. 14-21, 2002.
138. G. J. Chaitin, "Meta-mathematics and the foundations of mathematics," Bulletin EATCS, vol. 77, pp. 167-179, 2002.
139. G. J. Chaitin, "On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility," http://arxiv.org/math.HO/0210035, 2002.
140. P. A. Schilpp, The Philosophy of Bertrand Russell, Open Court, 1944.
141. A. Einstein, Ideas and Opinions, Crown, 1954, Modern Library, 1994.
142. A. Einstein, Autobiographical Notes, Open Court, 1979.
143. K. Gödel, Collected Works, vols. 1-5, Oxford University Press, 1986-2003.
144. Kurt Gödel: Wahrheit & Beweisbarkeit [truth and provability], vols. 1-2, öbv & hpt, 2002.
145. T. Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
146. G. J. Chaitin, Exploring Randomness, Springer-Verlag, 2001.
147. Gerald W. Alexanderson, The Random Walks of George Pólya, MAA, 2000.
148. John D. Barrow, Frank J. Tipler, The Anthropic Cosmological Principle, Oxford University Press, 1986.
149. John D. Barrow, Between Inner Space and Outer Space, Oxford University Press, 1999.
150. Reda Benkirane, La Complexité, Vertiges et Promesses, Le Pommier, 2002.
151. Max Born, Experiment and Theory in Physics, Cambridge University Press, 1943. Reprinted by Dover, 1956.
152. Luc Brisson, F. Walter Meyerstein, Inventer l’Univers, Les Belles Lettres, 1991.
153. Luc Brisson, F. Walter Meyerstein, Inventing the Universe, SUNY Press, 1995.
154. Luc Brisson, F. Walter Meyerstein, Puissance et Limites de la Raison, Les Belles Lettres, 1995.
155. F. Bródy, T. Vfiamos, The Neumann Compendium, World Scientić, 1995.
156. Bernd Buldt et al., Kurt Gödel, Wahrheit & Beweisbarkeit. Band 2: Kompendium zum Werk, öbv & hpt, 2002.
157. Cristian S. Calude, Information and Randomness, Springer-Verlag, 2002.
158. Gregory J. Chaitin, The Limits of Mathematics, The Unknowable, Exploring Randomness, Conversations with a Mathematician, Springer-Verlag, 1998, 1999, 2001, 2002.
159. John Cornwell, Nature’s Imagination, Oxford University Press, 1995.
160. COSRIMS, The Mathematical Sciences, MIT Press, 1969.
161. Albert Einstein, Ideas and Opinions, Crown, 1954. Reprinted by Modern Library, 1994.
162. Albert Einstein, Autobiographical Notes, Open Court, 1979.
163. Richard Feynman, The Character of Physical Law, MIT Press, 1965. Reprinted by Modern Library, 1994, with a thoughtful introduction by James Gleick.
164. Richard P. Feynman, Robert B. Leighton, Matthew Sands, The Feynman Lectures on Physics, Addison-Wesley, 1963.
165. Dale Jacquette, Philosophy of Mathematics, Blackwell, 2002.
166. Mark Kac, Gian-Carlo Rota, Jacob T. Schwartz, Discrete Thoughts, Birkhäuser, 1992.
167. Eckehart Köhler et al., Kurt Gödel, Wahrheit & Beweisbarkeit. Band 1: Dokumente und historische Analysen, öbv & hpt, 2002.
168. Bernd-Olaf Küppers, Information and the Origin of Life, MIT Press, 1990.
169. G. W. Leibniz, Philosophical Essays, edited and translated by Roger Ariew and Daniel Garber, Hackett, 1989.
170. Ernst Mach, The Science of Mechanics, Open Court, 1893.
171. Paolo Mancosu, From Brouwer to Hilbert, Oxford University Press, 1998.
172. Karl Menger, Reminiscences of the Vienna Circle and the Mathematical Colloquium, Kluwer, 1994.
173. James R. Newman, The World of Mathematics, Simon and Schuster, 1956. Reprinted by Dover, 2000.
174. Karl R. Popper, The Logic of Scientić Discovery, Hutchinson Education, 1959. Reprinted by Routledge, 1992.
175. Gian-Carlo Rota, Indiscrete Thoughts, Birkhäuser, 1997.
176. Paul Arthur Schilpp, Albert Einstein, Philosopher-Scientist, Open Court, 1949.
177. Karl Svozil, Randomness & Undecidability in Physics, World Scientić, 1994.
178. Vladimir Tasić, Mathematics and the Roots of Postmodern Thought, Oxford University Press, 2001.
179. Thomas Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
180. Hermann Weyl, The Open World, Yale University Press, 1932. Reprinted by Ox Bow Press, 1989.
181. Hermann Weyl, Philosophy of Mathematics and Natural Science, Princeton University Press, 1949.
182. Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002.
183. Hervé Zwirn, Les Limites de la Connaissance, Odile Jacob, 2000.
184. G. J. Chaitin, Exploring Randomness, Springer-Verlag, 2001.
185. G. J. Chaitin, The Unknowable, Springer-Verlag, 1999.
186. G. J. Chaitin, The Limits of Mathematics, Springer-Verlag, 1998.
187. G. J. Chaitin, Conversations with a Mathematician, Springer-Verlag, 2002.
188. G. J. Chaitin, "On the intelligibility of the universe and the notions of simplicity, complexity and irreducibility," German Philosophy Association, in press.
189. M. du Sautoy, The Music of the Primes, HarperCollins, 2003.
190. G. J. Chaitin, From Philosophy to Program Size, Tallinn Cybernetics Institute, in press.
191. H. Weyl, The Open World, Yale University Press, 1932, Ox Bow Press, 1989.
192. H. Weyl, Philosophy of Mathematics and Natural Science, Princeton University Press, 1949.
193. G. W. Leibniz, Philosophical Essays, Hackett, 1989.
194. Leibniz, Discours de métaphysique, Gallimard, 1995.
195. M. Davis, The Universal Computer: The Road from Leibniz to Turing, Norton, 2000.
196. J. L. Casti, The One True Platonic Heaven, Joseph Henry Press, 2003.
197. E. T. Bell, Mathematics, Queen and Servant of Science, Tempus, 1951.
198. G. J. Chaitin, Algorithmic Information Theory, Cambridge University Press, 1987.
199. T. Ord and T. D. Kieu, "On the existence of a new family of diophantine equations for," http://arxiv.org/math.NT/0301274.
200. P. Raatikainen, Book review, AMS Notices 48, Oct. 2001, pp. 992-996.
201. H.-U. Obrist, Interviews, Charta, 2003.
202. G. J. Chaitin, "Meta-mathematics and the foundations of mathematics," EATCS Bulletin 77, June 2002, pp. 167-179.
203. O. Postel-Vinay, "L’Univers est-il un calculateur?" [Is the universe a calculator?], La Recherche 360, Jan. 2003, pp. 33-44.
204. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000.
205. S. Wolfram, A New Kind of Science, Wolfram Media, 2002.
206. L. Smolin, Three Roads to Quantum Gravity, Weidenfeld and Nicolson, 2000.
207. T. Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
208. J. Borwein and D. Bailey, Mathematics by Experiment, A. K. Peters, in press.
209. J. Borwein and D. Bailey, Experimentation in Mathematics, A. K. Peters, in press.
210. D. S. Robertson, The New Renaissance, Oxford University Press, 1998.
211. D. S. Robertson, Phase Change, Oxford University Press, 2003.
212. J. Maynard Smith and E. Szathmfiary, The Major Transitions in Evolution, Oxford University Press, 1995.
213. J. Maynard Smith and E. Szathmfiary, The Origins of Life, Oxford University Press, 1999.
214. C. S. Calude, Information and Randomness, Springer-Verlag, 2002.
215. E. T. Bell, Men of Mathematics, Simon and Schuster, 1937.
216. A. P. Coudert, Leibniz and the Kabbalah, Kluwer Academic, 1995.
217. Chapter on Leibniz in E. T. Bell, Men of Mathematics, Simon & Schuster, 1937.
218. R. C. Sleigh, Jr., Leibniz and Arnauld: A Commentary on Their Correspondence, Yale University Press, 1990.
219. H. Weyl, The Open World: Three Lectures on the Metaphysical Implications of Science, Yale University Press, 1932, Ox Bow Press, 1994.
220. First article by Lakatos in T. Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
221. M. Davis, The Universal Computer: The Road from Leibniz to Turing, Norton, 2000.
222. Play on Newton vs. Leibniz in C. Djerassi, D. Pinner, Newton’s Darkness: Two Dramatic Views, Imperial College Press, 2003.
223. J. Borwein, D. Bailey, Mathematics by Experiment: Plausible Reasoning in the 21st Century, A. K. Peters, 2004.
224. J. Borwein, D. Bailey, R. Girgensohn, Experimentation in Mathematics: Computational Paths to Discovery, A. K. Peters, 2004.
225. G. Chaitin, Meta Math! The Quest for Omega, to be published by Pantheon Books in 2005.
226. G. J. Chaitin, Meta Math!, 2005.
227. G. W. Leibniz, Discours de métaphysique, 1686.
228. G. W. Leibniz, Principles of Nature and Grace, 1714.
229. G. W. Leibniz, The Monadology, 1714.
230. H. Weyl, The Open World, 1932.
231. Borel, E. [1950] Lećons sur la Théorie des Fonctions (Gabay, Paris) pp. 161, 275.
232. Borel, E. [1952] Les Nombres Inaccessibles (Gauthier-Villars, Paris) p. 21.
233. Borel, E. [1960] Space and Time (Dover, Mineola) pp. 212-214.
234. Chaitin, G. [2005] Meta Math! (Pantheon, New York).
235. Copeland, B. J. [2004] The Essential Turing (Clarendon Press, Oxford).
236. Courant, R. & Robbins, H. [1947] What is Mathematics? (Oxford University Press, New York) Sec. II.4.2, pp. 79-83.
237. Fredkin, E. [2004] http://digitalphilosophy.org
238. James, I. [2002] Remarkable Mathematicians (Cambridge University Press, Cambridge) pp. 283-292.
239. Smolin, L. [2000] Three Roads to Quantum Gravity (Weidenfeld & Nicolson, London) Chap. 8, pp. 95-105, Chap. 12, pp. 169-178.
240. Tasić, V. [2001] Mathematics and the Roots of Postmodern Thought (Oxford University Press, New York) pp. 52, 81-82.
241. Wolfram, S. [2002] A New Kind of Science (Wolfram Media, Champaign).
242. Edward Fredkin, http://digitalphilosophy.org.
243. Stephen Wolfram, A New Kind of Science, Wolfram Media, 2002.
244. Gregory Chaitin, Meta Math!, Pantheon, 2005.
245. G. W. Leibniz, Discourse on Metaphysics, Principles of Nature and Grace, The Monadology, 1686, 1714, 1714.
246. Hermann Weyl, The Open World, Yale University Press, 1932.
247. Thomas Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, 1998.
248. Jonathan Borwein, David Bailey, Roland Girgensohn, Mathematics by Experiment, Experimentation in Mathematics, A. K. Peters, 2003, 2004.
249. Rebecca Goldstein, Incompleteness, Norton, 2005.
250. B. Jack Copeland, The Essential Turing, Oxford University Press, 2004.
251. Vladimir Tasic, Mathematics and the Roots of Postmodern Thought, Oxford University Press, 2001.
252. Emile Borel, Les nombres inaccessibles, Gauthier-Villars, 1952.
253. Lee Smolin, Three Roads to Quantum Gravity, Basic Books, 2001.
254. Hans Christian von Baeyer, Information, Harvard University Press, 2004.
255. Ernst Mayr, This is Biology, Harvard University Press, 1998.
256. J. Wheeler, "It from bit," Sakharov Memorial Lectures on Physics, vol. 2, Nova Science, 1992.
257. A. Zeilinger, "A foundational principle for quantum mechanics," Found. Phys. 29, 631-643 (1999).
258. G. ‘t Hooft, "The holographic principle," http://arxiv.org/hep-th/0003004.
259. S. Lloyd, "The computational universe," http://arxiv.org/quant-ph/0501135.
260. P. Zizzi, "A minimal model for quantum gravity," http://arxiv.org/gr-qc/0409069.
261. J. Mäkelä, "Accelerating observers, area and entropy," http://arxiv.org/gr-qc/0506087.
262. T. Jacobson, "Thermodynamics of spacetime," http://arxiv.org/gr-qc/9504004.
263. Martin Davis, The Undecidable, Dover Publications, Mineola, New York, 2004.
264. Torkel Franzén, Gödel’s Theorem, A. K. Peters, Wellesley, Massachusetts, 2005.
265. Torkel Franzén, "The popular impact of Gödel’s incompleteness theorem," Notices of the AMS, April 2006, pp. 440-443.
266. Gregory Chaitin, Meta Math!, Pantheon Books, New York, 2005.
267. Gregory Chaitin, "The limits of reason," Scientić American, March 2006, pp. 74-81.7
268. Gregory Chaitin, Teoria algoritmica della complessitfia, Giappichelli Editore, Turin, 2006.
269. G. W. Leibniz, Discours de métaphysique, Gallimard, Paris, 1995.
270. Thomas Tymoczko, New Directions in the Philosophy of Mathematics, Princeton University Press, Princeton, New Jersey, 1998.
271. Jonathan Borwein and David Bailey, Mathematics by Experiment, A. K. Peters, Wellesley, Massachusetts, 2004.
272. http://www.santafe.edu/~walter/AlChemy/
273. http://www.his.atr.jp/~ray/.
274. http://en.wikipedia.org/wiki/AutomatedfiMathematician.
275. http://pauli.uni-muenster.de/~munsteg/arnold.html
276. http://www.dartmouth.edu/~matc/MathDrama/reading/Wigner.html.
277. J. Kemeny, "Man viewed as a machine," Scientić American, April 1955, pp. 58-67.
278. J. von Neumann, Theory of Self-Reproducing Automata, University of Illinois Press, Urbana, 1967.
279. M. Ridley, Francis Crick, Eminent Lives, New York, 2006.
280. G. Chaitin, Meta Math!, Pantheon Books, New York, 2005.
281. G. Chaitin, "The limits of reason," Scientić American, March 2006, pp. 74-81.
282. G. Chaitin, "Epistemology as information theory: From Leibniz to," European Computing and Philosophy Conference, Västeraas, Sweden, June 2005.
283. G. Chaitin, "To a mathematical definition of ‘life’," ACM SICACT News, January 1970, pp. 12-18.
284. G. Chaitin, "Toward a mathematical definition of ‘life’," R. Levine, M. Tribus, The Maximum Entropy Formalism, MIT Press, 1979, pp. 477-498.
285. G. Chaitin, "Algorithmic information and evolution," O. Solbrig, G. Nicolis, Perspectives on Biological Complexity, IUBS Press, 1991, pp. 51-60.
286. G. Chaitin, "Complexity and biology," New Scientist, 5 October 1991, p. 52.
287. G. Chaitin, "Meta-mathematics and the foundations of mathematics," Bulletin of the European Association for Theoretical Computer Science, June 2002, pp. 167-179.
288. D. Lenat, "Automated theory formation in mathematics," pp. 833-842 in volume 2 of R. Reddy, Proceedings of the 5th International Joint Conference on Artićial Intelligence, Cambridge, MA, August 1977, William Kaufmann, 1977.
289. C. S. Calude, M. J. Dinneen, "Exact approximations of numbers," International Journal of Bifurcation and Chaos 17 (2007), in press.
290. C. S. Calude, E. Calude, M. J. Dinneen, "A new measure of the dićulty of problems," Journal of Multiple-Valued Logic and Soft Computing 12 (2006), pp. 285-307.
291. G. Chaitin, "The limits of reason," Scientić American 294, № 3 (March 2006), pp. 74-81.
292. G. Chaitin, Meta Math!, Pantheon, New York, 2005, Meta Maths, Atlantic Books, London, 2006.
293. G. Chaitin, "The halting probability: Irreducible complexity in pure mathematics," Milan Journal of Mathematics 75 (2007), in press.
294. G. Chaitin, Meta Math!, Pantheon, New York, 2005 (hardcover), Vintage, New York, 2006 (softcover).
295. G. Chaitin, Meta Maths, Atlantic Books, London, 2006.
296. U. Pagallo, Introduzione alla filosofia digitale. Da Leibniz a Chaitin, Giappichelli, Turin, 2005.
297. G. Chaitin, Teoria algoritmica della complessitfia, Giappichelli, Turin, 2006.
298. U. Pagallo, Teoria giuridica della complessitfia, Giappichelli, Turin, 2006.
299. G. Chaitin, "How real are real numbers?," International Journal of Bifurcation and Chaos 16 (2006), pp. 1841-1848.
300. G. Chaitin, "Epistemology as information theory: From Leibniz to," Collapse 1 (2006), pp. 27-51.
301. G. Chaitin, "The limits of reason," Scientić American 294, № 3 (March 2006), pp. 74-81. (Also published as "I limiti della ragione," Le Scienze,May 2006, pp. 66-73.)
302. M. Davis, The Undecidable, Raven Press, Hewlett, 1965, Dover, Mineola, 2004.
303. E. Borel, Lećons sur la théorie des fonctions, Gauthier-Villars, Paris, 1950, Gabay, Paris, 2003.