Minds and Machines 22 (3):149-165 (2012)
AbstractThe paper presents an exploration of conceptual issues that have arisen in the course of investigating speed-up and slowdown phenomena in small Turing machines, in particular results of a test that may spur experimental approaches to the notion of computational irreducibility. The test involves a systematic attempt to outrun the computation of a large number of small Turing machines (3 and 4 state, 2 symbol) by means of integer sequence prediction using a specialized function for that purpose. The experiment prompts an investigation into rates of convergence of decision procedures and the decidability of sets in addition to a discussion of the (un)predictability of deterministic computing systems in practice. We think this investigation constitutes a novel approach to the discussion of an epistemological question in the context of a computer simulation, and thus represents an interesting exploration at the boundary between philosophical concerns and computational experiments.
Similar books and articles
Determinism, predictability and open-ended evolution: lessons from computational emergence.Philippe Huneman - 2012 - Synthese 185 (2):195-214.
Observability of Turing Machines: a refinement of the theory of computation.Yaroslav Sergeyev & Alfredo Garro - 2010 - Informatica 21 (3):425–454.
A simple comment regarding the Turing test.Benny Shanon - 1989 - Journal for the Theory of Social Behaviour 19 (June):249-56.
Minds, machines and Searle.Stevan Harnad - 1989 - Journal of Experimental and Theoretical Artificial Intelligence 1 (4):5-25.
Significance of Models of Computation, from Turing Model to Natural Computation.Gordana Dodig-Crnkovic - 2011 - Minds and Machines 21 (2):301-322.
Minds, machines and Searle.Stevan Harnad - 1989 - Journal of Theoretical and Experimental Artificial Intelligence 1:5-25.
The Turing Test: Verbal Behavior as the Hallmark of Intelligence.Stuart M. Shieber (ed.) - 2004 - MIT Press.
The duality principle: Irreducibility of sub-threshold psychophysical computation to neuronal brain activation.Jonathan Bentwich - 2006 - Synthese 153 (3):451-455.
Evolved Computing Devices and the Implementation Problem.Lukáš Sekanina - 2007 - Minds and Machines 17 (3):311-329.
Added to PP
Historical graph of downloads
Citations of this work
What Is Nature-Like Computation? A Behavioural Approach and a Notion of Programmability.Hector Zenil - 2013 - Philosophy and Technology (3):1-23.
What Is Nature-Like Computation? A Behavioural Approach and a Notion of Programmability.Hector Zenil - 2014 - Philosophy and Technology 27 (3):399-421.
References found in this work
The Fabric of Reality the Science of Parallel Universes and its Implications.David Deutsch & Roger Deutsch - 1997 - Viking Adult.
Computational speed-up by effective operators.Albert R. Meyer & Patrick C. Fischer - 1972 - Journal of Symbolic Logic 37 (1):55-68.
Computer Studies of Turing Machine Problems.Shen Lin, Tibor Rado, Allen H. Brady & Milton W. Green - 1975 - Journal of Symbolic Logic 40 (4):617-617.