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

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

verything about the universe. They are ultimately bound by the program that set them up in the first place.This is the way Seth Lloyd explains it: "Godel showed that the capacity for self-reference leads automatically to paradoxes in logic; the British mathematician Alan Turing showed that self-refere

everything about the universe. They are ultimately bound by the program that set them up in the first place.This is the way Seth Lloyd explains it: "Godel showed that the capacity for self-reference leads automatically to paradoxes in logic; the British mathematician Alan Turing showed that self-refer

n" I'm not sure about self awareness but self-referential math famously gives paradoxical result. This capacity for self reference is the basis for Godel's incompleteness theorem and Turing's halting problem (plus the free will results that I mentioned). Seth On Mon, Oct 24, 2016 at 5:58 AM, jeffre

ines. To the objection "I hope not," Baring turns away—though today thinkers like Hawking, Musk, and Gates embrace the fear. To the objection that Godel took care of that for us. TUr- ing points out that G0del took care of only a specific form of incompleteness, which might not be relevant, and besid

's view of the nature of time, a useful book with lots of source data references is Palle Yourgrau's: "A World without Time: The For otten Le ac of Godel and Einstein." (FYI: Jim Holt's review: Scrat_ atlai ) The physicist Stephon Alexander, whom I described as being in the FQX network is: EFTA_R1

ack and rethink the framework we have constructed to make sense of the world and our place in it. Consider the developments during the 1930s- 1940s: Godel's Incompleteness Theorems (1931); Turing's "On Computable Numbers, With An Application To The Entscheidungsproblem" (1936); Bateson's theory of "Sch

semantics (for instance, =he axioms that a statement can be reduced to in a proof) can take an =rbitrary number of steps, including infinitely many. Godel could =how that if we allow self referential statements, we cannot always =uarantee that the proof does not lead to contradictions and the =emantic

everything about the universe. They are ultimately bound by the program that set them up in the first place.This is the way Seth Lloyd explains it: "Godel showed that the capacity for self-reference leads automatically to paradoxes in logic; the British mathematician Alan Turing showed that self-refere

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

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

e: I'm not sure about self awareness bu= self•referential math famously gives paradoxical result. Thi= capacity for self reference is the basis for Godel's incompleteness t=eorem and Turing's halting problem (plus the free will results that l<=iv>mentioned). Seth On Mon, Oct 24, 2016 at 5:58 AM, je=

n, a principle in which physical reality is implemented, and that might make it possible to be conscious in actuality. Penrose is wrong to hope that Godel provided evidence for that, but his fundamental motivation is sincere. To get to an understanding of such a hypothetical metacomputational operator