艾伦·图灵

Agora

艾伦·图灵

1912–1954

初步了解有意简化——人物介绍讲得更多

凡是可以通过一步一步遵循规则来计算的东西，都可以由一种简单的机器来计算——而与其问机器是否会思考，我们不如问它们是否能与人类难以区分地交谈。

定位

自然科学与人文科学 · 北欧 · 心灵与意识, 逻辑学, 科学

以“图灵机”（1936年）定义了可计算性；1950年他提议用一场模仿游戏——图灵测试——取代“机器能思考吗？”这一问题，由此开启了人工智能哲学。

核心思想

图灵机
通用机与不可判定性
模仿游戏

在星图中打开

影响

受影响于 4

大卫·希尔伯特

受其影响
Turing answered Hilbert and Ackermann’s decision problem (Grundzüge der theoretischen Logik, 1928) in the negative, defining computability through his machines (‘On Computable Numbers’, 1936). A. M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem” (1936–37); D. Hilbert and W. Ackermann, Grundzüge der theoretischen Logik (1928); SEP “Hilbert’s Program”; SEP “Alan Turing”
依据: AI 草稿
大卫·希尔伯特 › 1862–1943
伯特兰·罗素

受其影响
Turing studied Russell’s Introduction to Mathematical Philosophy in 1933, according to Hodges, and later adapted Russell’s theory of types (‘Practical Forms of Type Theory’, 1948). A. Hodges, Alan Turing: The Enigma (1983); A. M. Turing, “Practical Forms of Type Theory”, Journal of Symbolic Logic 13 (1948); B. Russell, Introduction to Mathematical Philosophy (1919)
依据: 亦见于 InPhO · InPhO
伯特兰·罗素 › 1872–1970
路德维希·维特根斯坦

受其影响存在争议
Turing attended Wittgenstein’s Cambridge lectures on the foundations of mathematics (1939) and argued with him over contradictions; how far this shaped Turing’s work is disputed. C. Diamond (ed.), Wittgenstein’s Lectures on the Foundations of Mathematics, Cambridge, 1939 (1976); J. Floyd, “Turing on ‘Common Sense’: Cambridge Resonances”, in J. Floyd and A. Bokulich (eds.), Philosophical Explorations of the Legacy of Alan Turing (2017)
依据: AI 草稿
路德维希·维特根斯坦 › 1889–1951
库尔特·哥德尔

受其影响
Turing related his unsolvability proof for the Entscheidungsproblem to Gödel’s incompleteness theorem and, like Gödel’s arithmetisation, coded machines as numbers (‘On Computable Numbers’, 1936). A. M. Turing, “On Computable Numbers, with an Application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society 42 (1936–37); K. Gödel, Monatshefte für Mathematik und Physik 38 (1931); SEP “Alan Turing”
依据: AI 草稿
库尔特·哥德尔 › 1906–1978

影响了 4

希拉里·普特南

影响了
Putnam modelled mental states on the states of a Turing machine, founding machine functionalism (‘Minds and Machines’, 1960; ‘Psychological Predicates’, 1967). H. Putnam, “Minds and Machines”, in S. Hook (ed.), Dimensions of Mind (1960); “Psychological Predicates” (1967), repr. as “The Nature of Mental States”; SEP “Functionalism”
依据: 亦见于 InPhO · InPhO
希拉里·普特南 › 1926–2016
杰里·福多

影响了
Fodor built his computational theory of mind on Turing’s model of computation: thinking is rule-governed manipulation of symbols in a language of thought (The Language of Thought, 1975). J. A. Fodor, The Language of Thought (1975); The Mind Doesn’t Work That Way (2000); SEP “The Computational Theory of Mind”
依据: AI 草稿
杰里·福多 › 1935–2017
丹尼尔·丹尼特

影响了
Dennett defended Turing’s test as a fair criterion (‘Can Machines Think?’, 1985) and paired Turing with Darwin on competence without comprehension (From Bacteria to Bach and Back, 2017). D. C. Dennett, “Can Machines Think?” (1985), in Brainchildren (1998); From Bacteria to Bach and Back (2017); SEP “The Turing Test”
依据: 亦见于 InPhO · InPhO
丹尼尔·丹尼特 › 1942–2024
卢恰诺·弗洛里迪

影响了
Floridi called Turing’s the fourth revolution after Copernicus, Darwin and Freud: we are informational organisms (‘inforgs’) among other intelligent agents (The Fourth Revolution, 2014). L. Floridi, The Fourth Revolution: How the Infosphere Is Reshaping Human Reality (2014); The Philosophy of Information (2011)
依据: AI 草稿
卢恰诺·弗洛里迪 › 1964年生

批评

受批评于 1

约翰·塞尔

受其批评
Searle’s Chinese Room targeted the Turing test as a criterion of understanding: a program passing it by symbol manipulation need not understand anything (‘Minds, Brains, and Programs’, 1980). J. R. Searle, “Minds, Brains, and Programs”, Behavioral and Brain Sciences 3 (1980), 417–457; A. M. Turing, “Computing Machinery and Intelligence”, Mind 59 (1950)
依据: AI 草稿
约翰·塞尔 › 1932–2025

作品

1936论可计算数及其在判定问题上的应用
发表于《伦敦数学学会会刊》的论文：一台在纸带上读写符号的机器，刻画了一个按固定规则进行计算的人所能做的事；一台“通用”机器可以完成任何其他机器的工作，而希尔伯特的判定问题没有机械的解法——阿隆佐·丘奇在同一时期以另一种方法得到了这一结果。
1950计算机器与智能
机器能思考吗？模仿游戏。

立场

In 1936 Turing defined what it means for something to be computable by imagining a simple machine that reads and writes symbols on a tape. This “Turing machine” showed both the power and the limits of mechanical calculation – some problems can never be solved by any algorithm – and became the theoretical basis of the computer. In 1950 he asked whether machines can think and replaced the question with a test: if a machine can converse so that we cannot tell it from a human, we have no good reason to deny it intelligence. He answered many objections in advance, opening the philosophy of mind and of artificial intelligence.

生平与背景

Born in London in 1912, Turing studied mathematics at King’s College, Cambridge, and completed a doctorate at Princeton. During the Second World War he played a leading role at Bletchley Park in breaking the German Enigma code. Afterwards he designed early computers in London and Manchester. In 1952 he was convicted of “gross indecency” because of a relationship with a man – sexual acts between men were then a crime in Britain – and given the choice between prison and probation on condition of hormone treatment; he accepted the treatment. He died in 1954 of cyanide poisoning, which the inquest ruled suicide. In 2009 the British government apologised, and in 2013 he received a posthumous royal pardon.