Is there any Real Substance to the Claims for a 'New Computationalism'?

Computationalism is a relatively vague term used to describe attempts to apply Turing’s model of computation to phenomena outside its original purview: in modelling the human mind, in physics, mathematics, etc. Early versions of computationalism faced strong objections from many (and varied) quarters, from philosophers to practitioners of the aforementioned disciplines. Here we will not address the fundamental question of whether computational models are appropriate for describing some or all of the wide range of processes that they have been applied to, but will focus instead on whether ‘renovated’ versions of the new computationalism shed any new light on or resolve previous tensions between proponents and skeptics. We find this, however, not to be the case, because the new computationalism falls short by using limited versions of “traditional computation”, or proposing computational models that easily fall within the scope of Turing’s original model, or else proffering versions of hypercomputation with its many pitfalls.

[1]  William D. Clinger,et al.  Foundations of Actor Semantics , 1981 .

[2]  Nir Fresco,et al.  Physical Computation and Cognitive Science , 2013, Studies in Applied Philosophy, Epistemology and Rational Ethics.

[3]  Jerzy Mycka,et al.  A new conceptual framework for analog computation , 2007, Theor. Comput. Sci..

[4]  Yuri Gurevich,et al.  Sequential abstract-state machines capture sequential algorithms , 2000, TOCL.

[5]  S. Sajami,et al.  Representation and reality , 1993 .

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

[7]  E. Eberbach $-calculus Bounded Rationality = Process Algebra + Anytime Algorithms , 2001 .

[8]  David Hilbert Neubegründung der Mathematik. Erste Mitteilung , 1922 .

[9]  Mark Burgin,et al.  Super-Recursive Algorithms , 2004, Monographs in Computer Science.

[10]  Wilfried Sieg,et al.  Church Without Dogma: Axioms for Computability , 2008 .

[11]  Martin D. Davis The Myth of Hypercomputation , 2004 .

[12]  Dodig-CrnkovicGordana Significance of Models of Computation, from Turing Model to Natural Computation , 2011 .

[13]  J. Lucas Minds, Machines and Gödel , 1961, Philosophy.

[14]  Gordana Dodig-Crnkovic,et al.  Significance of Models of Computation, from Turing Model to Natural Computation , 2011, Minds and Machines.

[15]  Ulrich W. Eisenecker,et al.  AI: The Tumultuous History of the Search for Artificial Intelligence , 1995 .

[16]  N. David Mermin,et al.  The Emperor’s New Mind: Concerning Computers, Minds, and the Laws ofPhysics , 1990 .

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

[18]  Robin Milner,et al.  Communicating and mobile systems - the Pi-calculus , 1999 .

[19]  Alberto Hernández-Espinosa,et al.  Does the Principle of Computational Equivalence Overcome the Objections against Computationalism , 2013 .

[20]  C. Teuscher,et al.  Alan Turing: Life and Legacy of a Great Thinker , 2004, Springer Berlin Heidelberg.

[21]  Christopher G. Langton,et al.  Studying artificial life with cellular automata , 1986 .

[22]  Stephen Wolfram,et al.  A New Kind of Science , 2003, Artificial Life.

[23]  Roger Penrose,et al.  Précis of The Emperor's New Mind: Concerning computers, minds, and the laws of physics , 1990, Behavioral and Brain Sciences.

[24]  Carl Hewitt,et al.  What is Computation? Actor Model versus Turing's Model , 2012 .

[25]  ROBIN MILNER,et al.  Edinburgh Research Explorer A Calculus of Mobile Processes, I , 2003 .

[26]  Nir Fresco Objective Computation Versus Subjective Computation , 2014, Erkenntnis.

[27]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[28]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[29]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[30]  Matthias Scheutz,et al.  Computationalism: New Directions , 2003 .

[31]  Hava T. Siegelmann,et al.  RECURRENT NEURAL NETWORKS AND FINITE AUTOMATA , 1996, Comput. Intell..

[32]  Peter Wegner,et al.  Why interaction is more powerful than algorithms , 1997, CACM.

[33]  John R. Searle,et al.  Is the Brain a Digital Computer , 1990 .

[34]  Nachum Dershowitz,et al.  A Natural Axiomatization of Computability and Proof of Church's Thesis , 2008, Bulletin of Symbolic Logic.

[35]  A. Turing,et al.  On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction , 1938 .

[36]  M. S. Burgin Super-Recursive Algorithms (Monographs in Computer Science) , 2004 .

[37]  Carlos Eduardo Maldonado,et al.  Biological hypercomputation: A new research problem in complexity theory , 2015, Complex..

[38]  Jean-Paul Delahaye,et al.  Two-Dimensional Kolmogorov Complexity and Validation of the Coding Theorem Method by Compressibility , 2012, ArXiv.

[39]  Nelson Alfonso Gómez-Cruz,et al.  Biological Hypercomputation: A Concept is Introduced , 2012 .

[40]  Hector Zenil,et al.  A Computable Universe: Understanding and Exploring Nature As Computation , 2012 .

[41]  Alan M. Turing,et al.  Systems of Logic Based on Ordinals , 2012, Alan Turing's Systems of Logic.

[42]  Tom Froese,et al.  Turing instabilities in biology, culture, and consciousness? On the enactive origins of symbolic material culture , 2013, Adapt. Behav..

[43]  Peter Wegner,et al.  Interactive , 2021, Encyclopedia of the UN Sustainable Development Goals.

[44]  Jean-Paul Delahaye,et al.  Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility , 2012, PeerJ Comput. Sci..

[45]  T. Froese Life is Precious Because it is Precarious: Individuality, Mortality and the Problem of Meaning , 2017 .