Epstein Secrets

Michael Brooks. 13 Things That Don’t Make Sense : The Most Intriguing Scientific Mysteries of Our Time. Profile, 2010. Reason Special Interview with Roger Penrose, 2008. http://www.youtube.com/ watch?v=xiYDcl1LA014&feature=youtube_gdata_player. Reason Special Interview with Roger Penrose, 2008. http://www.yout

rly Journal of Mechanics and Applied Mathematics 1, no. 1 (1948): 287-308. Turing, Alan Mathison. “On Computable Numbers, with an Application to the Entscheidungsproblem.” J. of Math 58 (1936): 345-63. ———. “Systems of Logic Based on Ordinals.” Proceedings of the London Mathematical Society 2, no. 1 (1939): 161-228.

he could never decide which of two theses he wanted to defend: AJ is impossible! or Al is possible but evil! He wanted to argue, with John Searle and Roger Penrose, that “Strong AI” is impossible, but there are no good arguments for that conclusion. After all, everything we now know suggests that, as I have put

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu

he could never decide which of two theses he wanted to defend: AJ is impossible! or Al is possible but evil! He wanted to argue, with John Searle and Roger Penrose, that “Strong AI” is impossible, but there are no good arguments for that conclusion. After all, everything we now know suggests that, as I have put

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu