Hostname: page-component-745bb68f8f-cphqk Total loading time: 0 Render date: 2025-01-11T18:58:39.104Z Has data issue: false hasContentIssue false
  • English
  • Français

Turing Machine Arguments

Published online by Cambridge University Press:  01 April 2022

R. J. Nelson
R. J. Nelson*
Affiliation:
Case Western Reserve University
Get access Rights & Permissions [Opens in a new window]

Extract

In (Nelson 1976b) I used Turing machine arguments to show that computers can recognize humanly recognizable patterns in principle. In 1978 James D. Heffernan has expressed some doubts about such arguments. He does not question the propositions that I defend in the paper, nor the specific arguments in their support. What he does criticize are certain background assumptions.

Type
Discussion
Information
Philosophy of Science , Volume 47 , Issue 4 , December 1980 , pp. 630 - 633
Copyright
Copyright © 1980 by Philosophy of Science Association

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Burks, A. W., and Copi, I. M. (1956), “The Logical Design of an Idealized General Purpose Computer.” Journal of the Franklin Institute 261: 193–218; 279–297.CrossRefGoogle Scholar
Davis, M. (1958), Computability and Unsolvability. New York: McGraw-Hill.Google Scholar
Dreyfus, H. L. (1967), “Why Computers Must Have Bodies to be Intelligent.” Review of Metaphysics 21: 13–32.Google Scholar
Heffernan, J. D. (1978), “Some Doubts About ‘Turing Machine Arguments'.” Philosophy of Science 45: 638–647.CrossRefGoogle Scholar
Myhill, J. (1965), “Linear Bounded Automata.” WADC Tech. Note 60-165.Google Scholar
Nelson, R. J. (1976a), “Mechanism, Functionalism and the Identity Theory.” The Journal of Philosophy 63: 365–385.CrossRefGoogle Scholar
Nelson, R. J. (1976b), “On Mechanical Recognition.” Philosophy of Science 43: 24–52.CrossRefGoogle Scholar