## Emergence as a Computability-Theoretic Phenomenon (2008)

Citations: | 3 - 1 self |

### BibTeX

@MISC{Cooper08emergenceas,

author = {S. Barry Cooper},

title = {Emergence as a Computability-Theoretic Phenomenon },

year = {2008}

}

### OpenURL

### Abstract

In dealing with emergent phenomena, a common task is to identify useful descriptions of them in terms of the underlying atomic processes, and to extract enough computational content from these descriptions to enable predictions to be made. Generally, the underlying atomic processes are quite well understood, and (with important exceptions) captured by mathematics from which it is relatively easy to extract algorithmic content. A widespread view is that the difficulty in describing transitions from algorithmic activity to the emergence associated with chaotic situations is a simple case of complexity outstripping computational resources and human ingenuity. Or, on the other hand, that phenomena transcending the standard Turing model of computation, if they exist, must necessarily lie outside the domain of classical computability theory. In this talk we suggest that much of the current confusion arises from conceptual gaps and the lack of a suitably fundamental model within which to situate emergence. We examine the potential for placing emergent relations in a familiar context based on Turing’s 1939 model for interactive computation over structures described in terms of reals. The explanatory power of this model is explored, formalising informal descriptions in terms of mathematical definability and invariance, and relating a range of basic scientific puzzles to results and intractable problems in computability theory. In this talk

### Citations

1157 | M.: On computable numbers, with an application to the Entscheidungsproblem - Turing - 1936 |

903 | Behavior-Based Robotics - Arkin - 1998 |

716 |
A logical calculus of the ideas immanent in nervous activity
- McCulloch, Pitts
- 1943
(Show Context)
Citation Context ... since Turing’s [43] discussion of ‘unorganised machines’ (cf. Jack Copeland and Diane Proudfoot’s article [16] On Alan Turing’s Anticipation of Connectionism), and McCulloch and Pitts’ initial paper =-=[32]-=- on neural nets. But despite the growth of computational neuroscience as an active research area, putting together ingredients from both artificial neural networks and neurophysiology, something does ... |

637 |
The chemical basis of morphogenesis
- Turing
- 1952
(Show Context)
Citation Context ...nt of the Turing test. Turing himself played an innovative role in developing demystifying mathematics related to morphogenesis, and more particularly phyllotaxis, both in his seminal published paper =-=[44]-=- on the mathematical theory of biological pattern formation, and in his more opaque and incomplete writings contained in the posthumous collected works [45]. What is important though is not just the d... |

363 | On the proper treatment of connectionism - Smolensky - 1988 |

146 | The Fabric of Reality - Deutsch - 1998 |

123 |
Systems of Logic Based on Ordinals
- Turing
- 1939
(Show Context)
Citation Context ...alysis of the computability-theoretic content of emergence, to that leading to a better understanding of the computational role of emergence in the wider context. 4 The Turing Model Turing’s extended =-=[42]-=- 1939 model, able to capture the algorithmic content of those structures which are presented in terms of real numbers can be seen in implicit form in Newton’s Principia, published some 272 years earli... |

117 |
Recursively enumerable sets of positive integers and their decision problems
- Post
- 1944
(Show Context)
Citation Context ...l hierarchy a usable metaphor for what is happening here. What the arithmetical hierarchy encapsulates is the smallness of the computable world in relation to what we can describe. And Post’s Theorem =-=[35]-=- shows us how language can be used to progressively describe increasingly incomputable objects and phenomena within computable structures. An analysis of lower levels of the hierarchy even gives us a ... |

108 |
On the nature of turbulence
- Ruelle, Takens
- 1971
(Show Context)
Citation Context ...tems implementing Newtonian laws. The early history of chaos theory is replete with examples exhibiting the right quality of surprisingness, nicely communicated by the term ‘strange attractor’ coined =-=[38]-=- by David Ruelle and Floris Takens in 1971. 4sOf course, there is now quite a long history (see for example [1]) aimed at describing and improving our understanding of emergence, and as time goes on t... |

97 |
Space-time and causal set
- Bombelli, Lee, et al.
- 1987
(Show Context)
Citation Context ... Citing Penrose as an early champion of the role of causality, he also mentions Rafael Sorkin, Fay Dowker, and Fotini Markopoulou, known in this context for their interesting work on causal sets (see =-=[4]-=-), which abstract from causality relevant aspects of its underlying ordering relation. Essentially, causal sets are partial orderings which are locally finite, providing a model of spacetime with buil... |

85 | The feeling of what happens - Damasio - 2000 |

75 |
Alan turing the enigma
- Hodges
- 1983
(Show Context)
Citation Context ...s earlier. Newton’s work established a more intimate relationship between mathematics and science, and one which held the attention of Turing, in various guises, throughout his short life (see Hodges =-=[25]-=-). Just as the history of arithmetically-based algorithms, underlying many human activities, eventually gave rise to models of computation such as the Turing machine, so the oracle Turing machine sche... |

56 | Autobiographical Notes - Einstein - 1949 |

41 |
The Trouble with Physics. The Rise of String Theory, the Fall of a Science and What Comes Next. : A Mariner Book
- Smolin
- 2006
(Show Context)
Citation Context ...ientifically important is at stake. A far more public controversy currently shapes developments around important issues affecting theoretical physics — see, for example the recent books of Lee Smolin =-=[40]-=- and Peter Woit [47]. As Peter Woit [47, p.1] describes, according to purely pragmatic criteria particle physics has produced a standard model which is remarkably successful, and has great predictive ... |

36 |
The Structure of Scientific Revolutions, Third Edition
- Kuhn
- 1996
(Show Context)
Citation Context ...ms. Despite decades of work by a number of leaders in the field, the exact status of the conjecture is still a matter of controversy. 13sFor those of us who have grown up with Thomas Kuhn’s 1962 book =-=[29]-=- on the structure of scientific revolutions, such difficulties and disagreements are not seen as primarily professional failures, or triggers to collective shame (although they may be that too), but r... |

31 |
Not Even Wrong. The Failure of String Theory and the Continuing Challange to Unify the Laws of Physics. London : Jonathan Cape
- Woit
- 2007
(Show Context)
Citation Context ...nt is at stake. A far more public controversy currently shapes developments around important issues affecting theoretical physics — see, for example the recent books of Lee Smolin [40] and Peter Woit =-=[47]-=-. As Peter Woit [47, p.1] describes, according to purely pragmatic criteria particle physics has produced a standard model which is remarkably successful, and has great predictive power: By 1973, phys... |

28 |
The relationship between matter and life
- Brooks
- 2001
(Show Context)
Citation Context ...th of computational neuroscience as an active research area, putting together ingredients from both artificial neural networks and neurophysiology, something does seem to be missing. As Rodney Brooks =-=[5]-=- says “neither AI nor Alife has produced artifacts that could be confused with a living organism for more than an instant.” Or as Steven Pinker puts it: “. . . neural networks alone cannot do the job”... |

23 |
Intelligent Machinery’, National Physical Laboratory Report
- Turing
- 1948
(Show Context)
Citation Context ...MRI), bring us much closer to obtaining useful models. As we noted in [9], connectionist models of computation based on the workings of the human brain have developed in sophistication since Turing’s =-=[43]-=- discussion of ‘unorganised machines’ (cf. Jack Copeland and Diane Proudfoot’s article [16] On Alan Turing’s Anticipation of Connectionism), and McCulloch and Pitts’ initial paper [32] on neural nets.... |

21 |
Computability and Physical Theories
- Geroch, Hartle
- 1986
(Show Context)
Citation Context ...ficient. Otherwise, one is faced with the practical problem of extracting some hidden algorithmic content, perhaps via useful approximations, special cases, or computer simulations. Geroch and Hartle =-=[22]-=- discuss this problem in their 1986 paper, in which they suggest that “quantum gravity does seem to be a serious candidate for a physical theory for whose application there is no algorithm.” For the l... |

17 | Church’s thesis: A kind of reducibility axiom for constructive mathematics - Kreisel - 1970 |

16 | Clockwork or Turing U/universe? – remarks on causal determinism and computability - Cooper - 1999 |

14 | Experimental computation of real numbers by Newtonian machines
- Beggs, Tucker
(Show Context)
Citation Context ...the start of the computation, preventing the kind of feedback that would be necessary to determine when it’s time to stop mixing. But such interactions, such as those involving physical oracles as in =-=[3]-=-, appear to take us beyond an analysis directly relevant to the computational ingredients of emergence as a basic computational phenomenon, and towards the more hybrid computational environments presa... |

13 |
Mathematical logic: what has it done for the philosophy of mathematics
- Kreisel
- 1967
(Show Context)
Citation Context ...be composite processes, in which the underlying physical principles are understood, but the mathematics of their workings outstrip available analytical techniques. Over forty years ago, Georg Kreisel =-=[27]-=- distinguished between classical systems and cooperative phenomena not known to have Turing computable behaviour, and proposed [28, p.143, Note 2] a collision problem related to the 3-body problem, wh... |

12 |
Some problems of definability in recursive function theory
- Rogers
- 1965
(Show Context)
Citation Context ...ased as it is on a careful analysis of the characteristics of algorithmic computation. This brings us to a well-known and challenging research programme, initiated by Hartley Rogers in his 1967 paper =-=[36]-=-, in which he drew attention to the fundamental problem of characterising the Turing invariant relations. Again, the intuition is that these are key to pinning down how basic laws and entities emerge ... |

11 |
Computability Theory. Chapman & Hall/CRC, Boca
- Cooper
- 2004
(Show Context)
Citation Context ...mething describable in a structure is said to be definable. The difference between computability and definability is well-known. For example, if you go to any basic computabil9sity text (e.g., Cooper =-=[7]-=-) you will find in the arithmetical hierarchy a usable metaphor for what is happening here. What the arithmetical hierarchy encapsulates is the smallness of the computable world in relation to what we... |

11 | How Can Nature Help Us Compute - Cooper - 2006 |

11 |
On Alan Turing's Anticipation of Connectionism”. Synthese 113
- Copeland, Proudfoot
- 1996
(Show Context)
Citation Context ...dels of computation based on the workings of the human brain have developed in sophistication since Turing’s [43] discussion of ‘unorganised machines’ (cf. Jack Copeland and Diane Proudfoot’s article =-=[16]-=- On Alan Turing’s Anticipation of Connectionism), and McCulloch and Pitts’ initial paper [32] on neural nets. But despite the growth of computational neuroscience as an active research area, putting t... |

8 |
A History of the Study of Phyllotaxis
- Adler, Barabe, et al.
- 1997
(Show Context)
Citation Context ...t quality of surprisingness, nicely communicated by the term ‘strange attractor’ coined [38] by David Ruelle and Floris Takens in 1971. 4sOf course, there is now quite a long history (see for example =-=[1]-=-) aimed at describing and improving our understanding of emergence, and as time goes on the observer ‘surprise’ criterion may not be as robust as the corresponding element of the Turing test. Turing h... |

8 |
2008) Reinventing the Sacred: A New View
- Kauffman
(Show Context)
Citation Context ... any situation in which there appears to be a breakdown in reductionist explanation, or where there appears to be a global rather than purely local causal dynamic at work. This is how Stuart Kauffman =-=[26]-=- argues in his recent book on Reinventing the Sacred: A New View of Science, Reason and Religion (p.281): We are beyond reductionism: life, agency, meaning, value, and even consciousness and morality ... |

7 |
A test for emergence
- Ronald, Sipper, et al.
(Show Context)
Citation Context ...model of science, and to come up with a suitably basic explanatory model, one needs to be more clear about what are the defining characteristics of 3semergent phenomena. Ronald, Sipper and Capcarrère =-=[37]-=- draw a parallel with the development of the Turing Test for intelligent machines, and use Turing’s observer-based approach to formulate an emergence test. They comment that “overly facile use of the ... |

6 |
Computation beyond Turing Machines: Seeking appropriate methods to model computing and human thought
- Wegner, Goldin
- 2003
(Show Context)
Citation Context ...on can be explained within the classical sequential model. A key ingredient, the addition of which does seem to stretch the classical Turing model, is that of internal connectivity. Goldin and Wegner =-=[23]-=- quote from Robin Milner’s 1991 Turing Award lecture [30, p.80]: Through the seventies, I became convinced that a theory of concurrency and interaction requires a new conceptual framework, not just a ... |

5 | Definability as hypercomputational effect
- Cooper
(Show Context)
Citation Context ...ne hand to transcend standard computabilitytheoretic frameworks, and on the other entice reductionist explanations of increasing implausibility. 3 Representations, Recursions, Memetic Transmission In =-=[9]-=- we considered the computational content of features of the real world, and more particularly, of developing computational practice. We looked at instances in which there appeared to be a fairly basic... |

5 | Collected Works: Mathematical Logic - Turing - 2001 |

4 | Computability and emergence, in Mathematical Problems from Applied Logic I. Logics for the XXIst Century - Cooper |

4 | Quantum physics and conscious thought, in Quantum Implications: Essays in honour of - Penrose - 1987 |

3 |
A Tentative Theory of Large Distance
- Friedan
(Show Context)
Citation Context ...te its mathematical attractions, there are growing misgivings about its claimed status as “the only game in town” as a unifying explanatory theory. Here is how one time string theorist Daniel Friedan =-=[21]-=- combatively puts it: The longstanding crisis of string theory is its complete failure to explain or predict any large distance physics. . . . String theory is incapable of deter14smining the dimensio... |

3 | Elements of interaction:Turing award lecture - Milner - 1993 |

2 |
Computability and emergence
- Cooper
- 2005
(Show Context)
Citation Context ...tics governing the emergence of new relations from chaotic environments. This leads us to turn the picture of re-representations of mental imaging as a describable mapping on its head, and think (see =-=[8]-=-) in terms of descriptions in terms of a structure defining, and hence determining, the mental re-representations. Looking at this more closely, what seems to be happening is that the brain stores awa... |

2 | Definability: The Collected Works of Emil L - Davis - 1994 |

2 |
Morphogenesis
- Turing
- 1992
(Show Context)
Citation Context ...otaxis, both in his seminal published paper [44] on the mathematical theory of biological pattern formation, and in his more opaque and incomplete writings contained in the posthumous collected works =-=[45]-=-. What is important though is not just the demystifying role of descriptions of emergent phenomena, but the representational functionality they point to. It is this latter aspect that takes us beyond ... |

1 |
The Incomputable Alan Turing, in the Proceedings of Alan Mathison Turing 2004: A celebration of his life and achievements
- Cooper
(Show Context)
Citation Context ...y, for which its practitioners have no explanation or evidence for its existence in the material world. One may be uneasy about the public criticisms by Martin Davis, Stephen Simpson, and others (see =-=[12]-=-), but their views are widely respected. This leaves many, with eyes wide enough open to see the accumulated evidence of real-world misbehaviour, looking elsewhere for models. Presented with phenomena... |

1 | Extending and interpreting Post’s Programme
- Cooper
(Show Context)
Citation Context ...speration to protect consistent histories by inventing new universes, when the mathematics of our observable universes already contains a straightforward explanation. We have argued (see for instance =-=[13]-=-) that many scientific puzzles can be explained in terms of failures of definability in different contexts, and that the key task is to identify useful theoretical models within which to investigate t... |

1 |
The Church-Turing Thesis: Breaking the Myth, in CiE 2005: New Computational Paradigms: Papers presented at the conference
- Goldin, Wegner
- 2005
(Show Context)
Citation Context ...enty of scope to widen the definition of what is ‘internal’ to a given system to bring a proposed new computational paradigm based on inadequately sourced oracles back into the classical fold. But in =-=[24]-=-, for instance, Goldin and Wegner are not just talking about parallelism and internal interactivity. And the inherent vagueness of examples they quote both stretch the mathematical analysis, and the r... |