Document Mentions (4 shared documents)

HOUSE_OVERSIGHT_015675_sub_003 - HOUSE_OVERSIGHT_015974

2 mentions1 same-page

Page ?Same page

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

at King’s College, Cambridge and was made a Fellow at only 22. In 1936 Turing, aged 24, published On Computable Numbers and their Application to the Entscheidungsproblem, not a snappy title, but one of the most influential mathematical works of the 20" century. The paper described the new the science of computing and

HOUSE_OVERSIGHT_015675_sub_005 - HOUSE_OVERSIGHT_016110

2 mentions1 same-page

Page ?Same page

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

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.

HOUSE_OVERSIGHT_016804_sub_001 - HOUSE_OVERSIGHT_016903

2 mentions1 same-page

Page ?Same page

than expected. One variation on this argument is Andrew Ng’s statement that it’s “like worrying about ove

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