Epstein Secrets

ring Test. In October 1950, the British journal Mind published an essay by Alan M. Turing titled, "Computing Machinery and Intelligence," in which Turing proposed an operational definition for "intelligence" [2]. This definition would come to be called "the Turing Test." Turing himself called it "the

t different one in which the interrogator was to attempt to determine the gender of two contestants, one male the other female. Interesting because Turing was homosexual and perhaps accustomed to such an imitation game. But in the matter of intelligence, such an operational definition made some sense

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

more complex than they first appear. They are infinite, yet there are different infinities, and they have meaning. The smallpox example above and the Turing numbers we will discover shortly suggest numbers do have meaning independent of culture and language. The next two chapters will show us what happens

away their secrets. The Enigma machine was an elegant compromise between a truly unbreakable code and a simple cipher. Unfortunately for the Germans, Turing was on the side of the Allies. In the 1930s almost all mathematics, accounting, and code-breaking were performed by humans using pencil and paper. I

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

n humans are generally intelligent, because their basic operations encompass Turing complete computation, and they can externalize their results in Turing complete languages. Given enough time and resources, it seems inevitable that we will model the function of our minds as well, and universal artifi

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

onstructed 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 "Schismogenesis" in Naven (1936); Rosenblueth

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

y so. Kind regards Brad On Thu, Jul 21. 2016 at 5:37 AM, Soren Brier Dear Brad wrote: As a biologist I will deny that we are a computers in the Turing understanding of it. I know we try to imitate living neural networks in the dead computers we have now. It gives a few steps forward but does not r

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

ss 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=frey E. <[email protected] <mail

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=

ss 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, jeffrey E. <[email protected]> wrote:

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

y so. Kind regards Brad On Thu, Jul 21, 2016 at 5:37 AM, Soren Brier Dear Brad wrote: As a biologist I will deny that we are a computers in the Turing understanding of it. I know we try to imitate living neural networks in the dead computers we have now. It gives a few steps forward but does not re

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

ul 21, 2016 at 5:37 AM, Soren Brier <[email protected]<mailto:[email protected]» wrote: Dear Brad As a biologist I will deny that we are a computers in the Turing understanding of it. I know we try to imitate living neural networks in the dead computers we have now. It gives a few steps forward but does not re

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