Abstract
Amongst the huge literature concerning emergence, reductionism and mechanism, there is a role for analysis of the underlying mathematical constraints. Much of the speculation, confusion, controversy and descriptive verbiage might be clarified via suitable modelling and theory. The key ingredients we bring to this project are the mathematical notions of definability and invariance, a computability theoretic framework in a real-world context, and within that, the modelling of basic causal environments via Turing’s 1939 notion of interactive computation over a structure described in terms of reals. Useful outcomes are: a refinement of what one understands to be a causal relationship, including non-mechanistic, irreversible causal relationships; an appreciation of how the mathematically simple origins of incomputability in definable hierarchies are materialised in the real world; and an understanding of the powerful explanatory role of current computability theoretic developments.
Research supported by a Royal Society International Joint Project Grant, and by EPSRC Research Grant No. EP/G000212, The computational structure of partial information: Definability in the local structure of the enumeration degrees.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alexander S (1927) Space, Time, and Deity. Macmillan, London
Arkin RC (1998) Behaviour-based Robotics. MIT, Cambridge, MA
Bacon F (1901) In: Spedding J, Ellis RL, Heath DD (eds) The Works, vol IV, Longmans, London
Blum L, Cucker F, Shub M, Smale S (1997) Complexity and Real Computation. Springer, New York
Brockman J (ed) (2006) What we believe but cannot prove: Today’s leading thinkers on science in the age of certainty. Harper Perennial, New York
Calude CS, Svozil K (2008) Quantum Randomness and Value Indefiniteness. Adv Sci Lett 1:165–168
Cooper SB (1998) Beyond Gödel’s Theorem: Turing Nonrigidity Revisited. In: Makowsky JA, Ravve EV (eds) Logic Colloquium ’95. In: Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, held in Haifa, Israel, August 9–18, 1995, Lecture Notes in Logic, vol 11. Springer, Berlin, pp 44–50
Cooper SB (2008) The Incomputable Alan Turing. In: Proceedings of Turing 2004: A Celebration of His Life and Achievements, electronically published (2008) by the British Computer Society: http://www.bcs.org/server.php?show=nav.9917
Cooper SB From Descartes to Turing: The Computational Content of Supervenience. To appear in Information and Computation (editors Mark Burgin and Gordana Dodig-Crnkovic), World Scientific Publishing Co.
Copeland J (1998) Turing’s O-machines, Penrose, Searle, and the Brain. Analysis 58:128–138
Damasio AR (1999) The Feeling of What Happens: Body and Emotion in the Making of Consciousness. Harcourt Brace, New York
Davis M (2000) The Universal Computer: The Road from Leibniz to Turing. W.W. Norton, New York
Davis M (2004) The Myth of Hypercomputation. In: Teuscher C (ed) Alan Turing: Life and Legacy of a Great Thinker. Springer, Berlin, pp 195–212
Deutsch D (1985) Quantum Theory, the Church Turing Principle, and the Universal Quantum Computer. Proc Roy Soc A 400:97–117
Einstein A (1950) Out of My Later Years. Philosophical Library, New York
Einstein A (1969) Autobiographical Notes. In: P Schilpp (ed) In: Albert Einstein: Philosopher-scientist. Open Court, La Salle, IL
Friedan D (2003) A Tentative Theory of Large Distance Physics. J High Energy Phys JHEP10:063
Gödel K (1931) Über formalunentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatsh Math Phys 38:173–198; translated in Davis M (ed) In: The Undecidable. Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions. Raven Press, Hewlitt
Guth AH (1997) The Inflationary Universe – The Quest for a New Theory of Cosmic Origins. Addison-Wesley, New York
Hadamard J (1945) The Psychology of Invention in the Mathematical Field. Princeton University Press, Princeton
Hertling P (2005) Is the Mandelbrot Set Computable? Math Logic Quart 51:5–18
Hodges A (1992) Alan Turing: The Enigma. Vintage, London
Hodges A (2004) What would Alan Turing have done after 1954? In: Teuscher C (ed) Alan Turing: Life and Legacy of a Great Thinker. Springer, Berlin
Kauffman SA (2008) Reinventing the Sacred: A New View of Science, Reason and Religion. Basic Books, New York
de Laplace PS (1951) Essai Philosophique sur les Probabilités. English trans. by F.W. Truscott and F.L. Emory. Dover, New York
Leibniz GW (1999) La Monadologie (1714). English translation by G.M. Ross
Lorenz E (1963) Deterministic Nonperiodic Flow. J Atmos Sci 20:130–141
McCulloch WS, Pitts WH (1943) A Logical Calculus of the Ideas Immanent in Neural Nets. Bulletin of Mathematical Biophysics 5:115–133
McLaughlin BP (1992) The Rise and Fall of British Emergentism. In: Beckermann A, Flohr H, Kim J (eds) Emergence or Reduction? – Essays on the Prospects of Nonreductive Physicalism. de Gruyter, Berlin, pp 49–93. Reprinted in Bedau MA, Humphreys P (eds) Emergence: Contemporary Readings in Philosophy and Science. MIT, Cambridge, MA pp 19–59
Németi I, Andréka H (2006) Can General Relativistic Computers Break the Turing Barrier? In: Beckmann A, Berger U, Löwe B, Tucker JV (eds) Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30–July 5, 2006, Proceedings. Lecture Notes in Computer Science 3988, Springer, Berlin, pp 398–412
Odifreddi P (1989) Classical Recursion Theory, vols I and II. North-Holland/Elsevier, Amsterdam
Pinker S (1997) How the Mind Works. W.W. Norton, New York
Post EL (1948) Degrees of Recursive Unsolvability: Preliminary Report (abstract). Bull Amer Math Soc 54:641–642
Penrose R (1994) The Emperor’s New Mind: Concerning Computers, Minds, and the Laws of Physics. Oxford University Press, Oxford
Rogers H Jr (1965) Some Problems of Definability in Recursive Function Theory. In: Crossley JN (ed) Sets, Models and Recursion Theory. Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August–September, North-Holland, Amsterdam, pp 183–201
Ronald EMA, Sipper M, Capcarrère MS (1999) Design, Observation, Surprise! A Test of Emergence. Artif Life 5:225–239. Reprinted in (Bedau MA, Humphreys P (eds) Emergence: Contemporary Readings in Philosophy and Science. MIT, Cambridge, MA, pp 287–304
Shaw R (1981) Strange Attractors, Chaotic Behaviour, and Information Flow. Z. Naturforsch, 36A:80–112
Shaw R (1984) The Dripping Faucet as a Model Chaotic System. The Science Frontier Express Series, Aerial Press, Santa Cruz, CA
Smolensky P (1988) On the Proper Treatment of Connectionism. Behavior Brain Sci 11:1–74
Smolin L (2006) The Trouble with Physics: The Rise of String Theory, the Fall of a Science and What Comes Next. Houghton Mifflin, New York
Teuscher C (2004) (ed) Alan Turing: Life and Legacy of a Great Thinker. Springer, Berlin
Turing AM (1936) On Computable Numbers, with an Application to the Entscheidungsproblem. Proc London Math Soc 422:230–265. Reprinted in Turing AM (ed) Collected Works: Mathematical Logic, 18–53
Turing AM (1939) Systems of Logic Based on Ordinals. Proc London Math Soc 45(2):161–228. Reprinted in Turing AM (ed) Collected Works: Mathematical Logic, pp 81–148
Turing AM (1948) Intelligent Machinery. National Physical Laboratory Report. In: Meltzer B, Michie D (eds) Machine Intelligence 5. Edinburgh University Press, Edinburgh, 1969, pp 3–23. Reprinted in Ince DC (ed) A.M. Turing, Collected Works: Mechanical Intelligence. North-Holland, Amsterdam, 1992, pp 107–127
van Leeuwen J, Wiedermann J (2000) The Turing Machine Paradigm in Contemporary Computing. In: Enquist B, Schmidt W (eds) Mathematics Unlimited – 2001 and Beyond, LNCS. Springer, Berlin
White M (1997) Isaac Newton – The Last Sorcerer. Fourth Estate, London
Woit P (2006) Not Even Wrong – The Failure of String Theory and the Continuing Challenge to Unify the Laws of Physics. Jonathan Cape, London
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media B.V.
About this paper
Cite this paper
Cooper, S.B. (2010). Incomputability, Emergence and the Turing Universe. In: Carsetti, A. (eds) Causality, Meaningful Complexity and Embodied Cognition. Theory and Decision Library A:, vol 46. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-3529-5_8
Download citation
DOI: https://doi.org/10.1007/978-90-481-3529-5_8
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-3528-8
Online ISBN: 978-90-481-3529-5
eBook Packages: Humanities, Social Sciences and LawPhilosophy and Religion (R0)