Epstein Secrets

Math 58 (1936): 345-63. ———. “Systems of Logic Based on Ordinals.” Proceedings of the London Mathematical Society 2, no. 1 (1939): 161-228. Wiles, Andrew. “Modular Elliptic Curves and Fermat’s Last Theorem.” Annals of Mathematics-Second Series 141, no. 3 (1995): 443-552. Chapter 12 Burgin, Mark. Supe

7. HOUSE_OVERSIGHT_016078 Bibliography 389 Franzén, Torkel. Gédel’s Theorem: An Incomplete Guide to Its Use and Abuse. AK Peters/CRC Press, 2005. Godel, Kurt. On Formally Undecidable Propositions of “Principia Mathematica” and Related Systems. New edition. Dover Publications Inc., 2003. Goldrei, D.C

f Software Engineering 231 Nova Institute 50 Nova Southeastern University 124 Nuclear Magnetic Resonance 104 numbers counting system 181 defining 199 Godel numbers 203 infinity 179 nature of 155 prime 156, 243, 343 random 188 real 186, 280 Turing numbers 190 zero 179 Nyquist, Harry xiii O Occam's Razor

me 11. Developmental Psychology, 1975. Arm04. J. Andrew Armour. Cardiac neuronal hierarchy in health and

ting human intelli- gence. Neuron vol. 76 issue 6, 2012. Hib02. Bill Hibbard. Superintelligent Machines. Springer, 2002. Hof79. Douglas Hofstadter. Godel, Escher, Bach: An Eternal Golden Braid. Basic, 1979. Hof95. Douglas Hofstadter. Fluid Concepts and Creative Analogies. Basic Books, 1995. Hof96. Do

NN’95, 1995. Sch02. Juergen Schmidhuber. Exploring the predictable.. Springer, 2002. HOUSE_OVERSIGHT_013265 350 A Glossary Sch06. J. Schmidhuber. Godel machines: Fully Self-referential Optimal Universal Self-improvers. In B. Goertzel and C. Pennachin, editors, Artificial General Intelligence, pages 1

11. Developmental Psychology, 1975. Artn04. J. Andrew Armour. Cardiac neuronal hierarchy in health and

c. ICANN'95, 1995. Sch02. Juergen Schmidhuber. Exploring the predictable.. Springer, 2002. EFTA00624125 350 A Glossary Sch06. J. Schmidhuber. Godel machines: Ashy Self-referential Optimal Universal Self-improvers. In B. Goertzel and C. Pennachin, editors, Artificial General Intelligence, pages 1

ill, this is an illusion. I simply don’t believe this. If I am right and humans do exercise free will, Andrew Wiles cannot be a computer. And because Andrew is not alone in discovering proofs, those mathematicians cannot be computers either. Humans are, therefore, not computers. The Chance Objection I s

ents is a proof, we can generate proof numbers. They are just the sequential list of all the instructions. These numbers are sometimes referred to as Godel numbers. Gédel’s next step was to say one number demonstrates the proof of another number. For example, the number 000820962 might demonstrate the p