Diane Proudfoot
Biographic Data
| ID | 3843476 |
|---|---|
| NAME | Diane Proudfoot |
| GIVEN NAMES | Diane |
| FAMILY NAME | Proudfoot |
| SIGNATURE | PROUDFOOT D |
| AFFILIATIONS | University of Canterbury |
| ORCID | 0000-0002-9736-4489 |
| VERIFIED | Yes |
| TOTAL WORKS | 7 |
| TOTAL CITATIONS | 60 |
| WORKS AS AUTHOR | 7 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 1996 |
| LATEST PUBLICATION YEAR | 2026 |
| H-INDEX | 3 |
Why No One Has Implemented the Turing Test
In October 1950, Alan Turing proposed that a machine’s success in an imitation game provides a criterion for thinking. Turing’s test became one of the philosophical foundations of AI, but three-quarters of a century later, it is widely claimed that generative AI models pass the test, rendering it obsolete. Our aim here is to establish definitively Turing’s conceptual design for his game. We argue that influential interpretations of Turing’s desig…
Turing’s Test vs the Moral Turing Test
An Analysis of Turing’s Criterion for ‘Thinking’
In this paper I argue that Turing proposed a new approach to the concept of thinking, based on his claim that intelligence is an ‘emotional concept’; and that the response-dependence interpretation of Turing’s ‘criterion for “thinking”’ is a better fit with his writings than orthodox interpretations. The aim of this paper is to clarify the response-dependence interpretation, by addressing such questions as: What did Turing mean by the expression …
Anthropomorphism
Deviant encodings and Turing’s analysis of computability
Wittgenstein's deflationary account of reference
On Alan Turing's anticipation of connectionism
It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks ‘unorganised machines’. By the application of what he described as ‘appropriate interference, mimicking education’ an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided…
Anthropomorphism
On Alan Turing's anticipation of connectionism
It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks ‘unorganised machines’. By the application of what he described as ‘appropriate interference, mimicking education’ an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided…
Deviant encodings and Turing’s analysis of computability
On Alan Turing's anticipation of connectionism
It is not widely realised that Turing was probably the first person to consider building computing machines out of simple, neuron-like elements connected together into networks in a largely random manner. Turing called his networks ‘unorganised machines’. By the application of what he described as ‘appropriate interference, mimicking education’ an unorganised machine can be trained to perform any task that a Turing machine can carry out, provided…
Wittgenstein's deflationary account of reference
Deviant encodings and Turing’s analysis of computability
Anthropomorphism
An Analysis of Turing’s Criterion for ‘Thinking’
In this paper I argue that Turing proposed a new approach to the concept of thinking, based on his claim that intelligence is an ‘emotional concept’; and that the response-dependence interpretation of Turing’s ‘criterion for “thinking”’ is a better fit with his writings than orthodox interpretations. The aim of this paper is to clarify the response-dependence interpretation, by addressing such questions as: What did Turing mean by the expression …
Turing’s Test vs the Moral Turing Test
Why No One Has Implemented the Turing Test
In October 1950, Alan Turing proposed that a machine’s success in an imitation game provides a criterion for thinking. Turing’s test became one of the philosophical foundations of AI, but three-quarters of a century later, it is widely claimed that generative AI models pass the test, rendering it obsolete. Our aim here is to establish definitively Turing’s conceptual design for his game. We argue that influential interpretations of Turing’s desig…
Computer Science (6 works) · Epistemology (5 works) · Psychology (5 works) · Artificial Intelligence (4 works) · Cognitive science (4 works) · Philosophy (4 works) · Turing (4 works) · Description number (3 works) · Programming language (3 works) · Super-recursive algorithm (3 works)