Two Dogmas of Computationalism

This paper challenges two orthodox theses: (a) that computational processes must be algorithmic; and (b) that all computed functions must be Turing-computable. Section 2 advances the claim that the works in computability theory, including Turing's analysis of the effective computable functions, do not substantiate the two theses. It is then shown (Section 3) that we can describe a system that computes a number-theoretic function which is not Turing-computable. The argument against the first thesis proceeds in two stages. It is first shown (Section 4) that whether a process is algorithmic depends on the way we describe the process. It is then argued (Section 5) that systems compute even if their processes are not described as algorithmic. The paper concludes with a suggestion for a semantic approach to computation.

[1]  David Lewis,et al.  Papers in Philosophical Logic: Analog and digital , 1971 .

[2]  S. Kleene.  General recursive functions of natural numbers , 1936 .

[3]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[4]  John Haugeland,et al.  Analog and Analog , 1981 .

[5]  Daniel J. Amit,et al.  Modeling brain function: the world of attractor neural networks, 1st Edition , 1989 .

[6]  Rolf Herken,et al.  The Universal Turing Machine: A Half-Century Survey , 1992 .

[7]  Oron Shagrir.  A Neural Net With Self-Inhibiting Units For The N-Queens Problem , 1992, Int. J. Neural Syst..

[8]  John J. Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities , 1999 .

[9]  S. Kleene.  $\lambda$-definability and recursiveness , 1936 .

[10]  Stephen C. Kleene,et al.  Turing's analysis of computability, and major applications of it , 1988 .

[11]  K. Gödel.  Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I , 1931 .

[12]  James H. Fetzer.  Mental Algorithms: Are Minds Computational Systems? , 1994 .

[13]  Carol E. Cleland.  Is the Church-Turing thesis true? , 1993, Minds and Machines.

[14]  S. Kleene,et al.  λ-Definability and Recursiveness. , 1937 .

[15]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[16]  Kurt Godel.  Remarks before the Princeton Bicentennial Conference on problems in mathematics , 1990 .

[17]  Wilfried Sieg,et al.  Mechanical Procedures and Mathematical Experience , 1991 .

[18]  Vinod Goel,et al.  Notationality and the information processing mind , 1991, Minds and Machines.

[19]  Rok Sosic,et al.  A polynomial time algorithm for the N-Queens problem , 1990, SGAR.

[20]  Michael Barr,et al.  The Emperor's New Mind , 1989 .

[21]  Emil L. Post.  Finite combinatory processes—formulation , 1936, Journal of Symbolic Logic.

[22]  M. B. Pour-El,et al.  Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) , 1974 .

[23]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[24]  J. Heijenoort.  From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931 , 1967 .

[25]  Stewart Shapiro,et al.  Remarks on the development of computability , 1983 .

[26]  On some fundamental distinctions of computationalism , 2004, Synthese.

[27]  M. B. Pour-El,et al.  The wave equation with computable initial data such that its unique solution is not computable , 1981 .

[28]  N. Goodman.  Languages of Art , 1968 .

[29]  Marian Boykan Pour-El,et al.  On a simple definition of computable function of a real variable-with applications to functions of a complex variable , 1975, Math. Log. Q..

[30]  Alonzo Church,et al.  A note on the Entscheidungsproblem , 1936, Journal of Symbolic Logic.

[31]  Rok Sosic,et al.  3,000,000 Queens in less than one minute , 1991, SGAR.

[32]  Martin Davis,et al.  The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions , 2004 .

[33]  Robin Gandy,et al.  Church's Thesis and Principles for Mechanisms , 1980 .

[34]  R. Penrose,et al.  Shadows of the Mind , 1994 .

[35]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[36]  Robert Cummins,et al.  Connectionism, computation, and cognition , 1991 .

[37]  Rudolf Arnheim.  Languages of Art. An Approach to a Theory of Symbols. Nelson Goodman. Bobbs-Merrill, Indianapolis, 1968. xiv + 278 pp., illus. $8 , 1969 .

[38]  Robin Gandy,et al.  The confluence of ideas in 1936 , 1988 .

[39]  Terrence J. Sejnowski,et al.  The Computational Brain , 1996, Artif. Intell..