Epstein Secrets

ivity versus 312 program equivalence problem 250 programmer 235, 238, 263 programming geniuses 271 super-programmers 266 progressive cipher 214 proof Feynman’s proof 157 indirect 244 mathematical 156 philosophical 246 Index 415 PSPACE problem 168 Pulitzer Prize 365, 367 purpose on the planet 9 puzzle tw

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.

to spend time with physicists, the reason being that they think about the universe, 1.e. everything. And no physicist was reputed to be articulate as Feynman. I couldn’t wait to meet him. I accepted. That said, I am not a scientist, and I had never entertained the idea of getting on a stage and delivering

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

to spend time with physicists, the reason being that they think about the universe, 1.e. everything. And no physicist was reputed to be articulate as Feynman. I couldn’t wait to meet him. I accepted. That said, I am not a scientist, and I had never entertained the idea of getting on a stage and delivering

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