Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Computer science as empirical inquiry: symbols and search
Communications of the ACM
Genetic Programming III: Darwinian Invention & Problem Solving
Genetic Programming III: Darwinian Invention & Problem Solving
Creativity, the Turing Test, and the (Better) Lovelace Test
Minds and Machines
Alan Turing and the Mathematical Objection
Minds and Machines
Can Machines Think? An Old Question Reformulated
Minds and Machines
Philosophy of Mind Is (in Part) Philosophy of Computer Science
Minds and Machines
| Hi-index | 0.00 |
In this paper I argue that Turing's responses to the mathematical objection are straightforward, despite recent claims to the contrary. I then go on to show that by understanding the importance of learning machines for Turing as related not to the mathematical objection, but to Lady Lovelace's objection, we can better understand Turing's response to Lady Lovelace's objection. Finally, I argue that by understanding Turing's responses to these objections more clearly, we discover a hitherto unrecognized, substantive thesis in his philosophical thinking about the nature of mind.