Abstract
What does it mean to claim that a physical or natural system computes? One answer, endorsed here, is that computing is about programming a system to behave in different ways. This paper offers an account of what it means for a physical system to compute based on this notion. It proposes a behavioural characterisation of computing in terms of a measure of programmability, which reflects a system’s ability to react to external stimuli. The proposed measure of programmability is useful for classifying computers in terms of the apparent algorithmic complexity of their evolution in time. I make some specific proposals in this connection and discuss this approach in the context of other behavioural approaches, notably Turing’s test of machine intelligence. I also anticipate possible objections and consider the applicability of these proposals to the task of relating abstract computation to nature-like computation.
Invited Talk at the Symposium on Natural/Unconventional Computing and its Philosophical Significance, AISB/IACAP Alan Turing World Congress 2012.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ausländer, S., Ausländer, D., Müller, M., Wieland, M., Fussenegger, M.: Programmable single-cell mammalian biocomputers. Nature (2012)
Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for your Mathematical Plays. AK Peters Ltd. (2001)
Blanco, J.: Interdisciplinary Workshop with Javier Blanco: Ontological, Epistemological and Methodological Aspects of Computer Science. University of Stuttgart, Germany (July 7, 2011)
Chaitin, G.J.: On the length of programs for computing finite binary sequences: Statistical considerations. Journal of the ACM 16(1), 145–159 (1969)
Chalmers, D.J.: Does a Rock Implement Every Finite-State Automaton? Synthese 108, 310–333 (1996)
Cook, M.: Universality in Elementary Cellular Automata. Complex Systems 15, 1–40 (2004)
Conrad, M.: The Price of Programmability. In: Herken, R. (ed.) The Universal Turing Machine, A Half-Century Survey. Springer (1994)
Berlekamp, E., Conway, K., Guy, R.: Winning Ways for your Mathematical Plays, vol. 2. Academic Press (1982)
Cronin, L., Krasnogor, N., Davis, B.G., Alexander, C., Robertson, N., Steinke, J.H.G., Schroeder, S.L.M., Khlobystov, A.N., Cooper, G., Gardner, P.M., Siepmann, P., Whitaker, B.J., Marsh, D.: The imitation game—a computational chemical approach to recognizing life. Nature Biotechnology 24(10) (2006)
Davis, M.: Universality is Ubiquitous, Invited Lecture. In: History and Philosophy of Computing (HAPOC 2011), Ghent, November 8 (2011)
Dennett, D.C.: Brainstorms: Philosophical Essays on Mind and Psychology. MIT Press (1981)
Delahaye, J.-P., Zenil, H.: Numerical Evaluation of the Complexity of Short Strings: A Glance Into the Innermost Structure of Algorithmic Randomness. Applied Math. and Comp. 219, 63–77 (2012)
Dresner, E.: Measurement-theoretic representation and computation-theoretic realisation. The Journal of Philosophy cvii(6) (2010)
Fodor, J.: The Language of Thought. Harvard University Press (1975)
Fredkin: Finite Nature. In: Proceedings of the XXVIIth Rencotre de Moriond (1992)
Harnad, S.: The Symbol Grounding Problem. Physica D 42, 335–346 (1990)
Hodgkin, A., Huxley, A.: A quantitative description of membrane current and its application to conduction and excitation in nerve. Journal of Physiology 117, 500–544 (1952)
Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems of Information and Transmission 1(1), 1–7 (1965)
Langton, C.G.: Studying artificial life with cellular automata. Physica D: Nonlinear Phenomena 22(1-3), 120–149 (1986)
Lloyd, S.: Computational capacity of the Universe. Physical Review Letters 88, 237901 (2002)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer (2008)
McCullock, W., Pitts, W.: A Logical Calculus of Ideas Immanent in Nervous Activity. Bulletin of Mathematical Biophysics 5(4), 115–133 (1943)
Minsky, M.: Computation: Finite and Infinite Machines. Prentice Hall (1967)
Parsons, W.T.: Patterns in the Noise: Physics as the Ultimate Environmental Science. FQXi’s, Essay Contest, Questioning the Foundations (2012)
Penrose, R.: The Emperor’s New Mind. Oxford University Press (1989)
Perlis, A.J.: Epigrams on Programming. SIGPLAN Notices 17(9), 7–13 (1982)
Piccinini, G.: Computers. Pacic Philosophical Quarterly 89, 32–73 (2008)
Putnam, H.: Representation and Reality. MIT Press, Cambridge (1988)
Margolus, N.: Physics-like Models of Computation. Physica 10D, 81–95 (1984)
Scott, D.S.: Outline of a mathematical theory of computation. Technical Monograph PRG-2. Oxford University Computing Laboratory, England (November 1970); Theoretical Computer Science 412, 183–190 (2011)
Searle, J.R.: The Rediscovery of the Mind. MIT Press (1992)
Searle, J.R.: Is the Brain a Digital Computer. In: Philosophy in a New Century, pp. 86–106. Cambridge University Press (2008)
Sutner, K.: Computational Processes, Observers and Turing Incompleteness
Turner, R.: Specification. Minds and Machines 21(2), 135–152 (2011)
Thomson, A.: Machine man and other writings. Cambridge University Press (1996)
Turing, A.M.: Systems of logic based on ordinals. Proc. London Math. Soc. 45 (1939)
Turing, A.M.: Computing Machinery and Intelligence. Mind 59, 433–460 (1950)
Wolfram, S.: A New Kind of Science. Wolfram Media (2002)
Woods, D., Neary, T.: The complexity of small universal Turing machines: a survey. Theor. Comput. Sci. 410(4-5), 443–450 (2009)
Zenil, H.: Compression-based investigation of the behaviour of cellular automata and other systems. Complex Systems 19(2) (2010)
Zenil, H., Soler-Toscano, F., Joosten, J.J.: Empirical Encounters With Computational Irreducibility and Unpredictability. Minds and Machines 222(3), 149–165 (2012)
Zenil, H.: On the Dynamic Qualitative Behaviour of Universal Computation. Complex Systems 20(3) (2012)
Zenil, H.: What is Nature-like Computation? A Behavioural Approach and a Notion of Programmability. Philosophy & Technology (2013), doi:10.1007/s13347-012-0095-2
Zenil, H.: Programmability for Natural Computation and the Game of Life as a Case Study. J. of Experimental & Theoretical Artificial Intelligence (forthcoming)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Zenil, H. (2013). A Behavioural Foundation for Natural Computing and a Programmability Test. In: Dodig-Crnkovic, G., Giovagnoli, R. (eds) Computing Nature. Studies in Applied Philosophy, Epistemology and Rational Ethics, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37225-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-37225-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37224-7
Online ISBN: 978-3-642-37225-4
eBook Packages: EngineeringEngineering (R0)