Minds, Machines and Turing

被引:33
|
作者
S. Harnad
机构
[1] University of Southampton,Department of Electronics and Computer Science
[2] Highfield,undefined
关键词
cognitive neuroscience; cognitive science; computation; computationalism; consciousness; dynamical systems; epiphenomenalism; intelligence; machines; mental models; mind/body problem; other minds problem; philosophy of science; qualia; reverse engineering; robotics; Searle; symbol grounding; theory of mind; thinking; Turing; underdetermination; Zombies;
D O I
10.1023/A:1008315308862
中图分类号
学科分类号
摘要
Turing's celebrated 1950 paper proposes a very generalmethodological criterion for modelling mental function: total functionalequivalence and indistinguishability. His criterion gives rise to ahierarchy of Turing Tests, from subtotal (“toy”) fragments of ourfunctions (t1), to total symbolic (pen-pal) function (T2 – the standardTuring Test), to total external sensorimotor (robotic) function (T3), tototal internal microfunction (T4), to total indistinguishability inevery empirically discernible respect (T5). This is a“reverse-engineering” hierarchy of (decreasing) empiricalunderdetermination of the theory by the data. Level t1 is clearly toounderdetermined, T2 is vulnerable to a counterexample (Searle's ChineseRoom Argument), and T4 and T5 are arbitrarily overdetermined. Hence T3is the appropriate target level for cognitive science. When it isreached, however, there will still remain more unanswerable questionsthan when Physics reaches its Grand Unified Theory of Everything (GUTE),because of the mind/body problem and the other-minds problem, both ofwhich are inherent in this empirical domain, even though Turing hardlymentions them.
引用
收藏
页码:425 / 445
页数:20
相关论文
共 50 条
  • [21] RECURSIVE TURING MACHINES
    SAVITCH, WJ
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1977, 6 (01) : 3 - 31
  • [22] Ecological turing machines
    Durand, B
    Muchnik, A
    Ushakov, M
    Vereshchagin, N
    [J]. AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 457 - 468
  • [23] Token Turing Machines
    Ryoo, Michael S.
    Gopalakrishnan, Keerthana
    Kahatapitiya, Kumara
    Xiao, Ted
    Rao, Kanishka
    Stone, Austin
    Lu, Yao
    Ibarz, Julian
    Arnab, Anurag
    [J]. 2023 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2023, : 19070 - 19081
  • [24] Noisy turing machines
    Asarin, E
    Collins, P
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1031 - 1042
  • [25] STRUCTURED TURING MACHINES
    PRATHER, RE
    [J]. INFORMATION AND CONTROL, 1977, 35 (02): : 159 - 171
  • [26] AN INQUIRY INTO DIVERS PRINCIPLES OF ART-MAKING MINDS AND MACHINES, BEING AN ESSAY ON TURING IN THE CHINESE ROOM
    Swirski, Peter
    [J]. PHILOSOPHY AND LITERATURE, 2014, 38 (1A) : A94 - A113
  • [27] Reactive Turing machines
    Baeten, Jos C. M.
    Luttik, Bas
    van Tilburg, Paul
    [J]. INFORMATION AND COMPUTATION, 2013, 231 : 143 - 166
  • [28] Involutory Turing Machines
    Nakano, Keisuke
    [J]. REVERSIBLE COMPUTATION (RC 2020), 2020, 12227 : 54 - 70
  • [29] Wittgenstein and Turing machines
    Wagner, P
    [J]. REVUE DE METAPHYSIQUE ET DE MORALE, 2005, (02): : 181 - 196
  • [30] MINDS AND MACHINES - COMMENT
    SHORT, RC
    [J]. ELECTRONICS AND POWER, 1974, 20 (02): : 76 - 76