Paper Info

Title | ||
---|---|---|

Emergence as a computability-theoretic phenomenon |

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. |

Year | DOI | Venue |
---|---|---|

2009 | 10.1016/j.amc.2009.04.050 | Applied Mathematics and Computation |

Keywords | Field | DocType |

emergence,computability,turing invariance,definability,denability,model of computation,computability theory | Mathematical optimization,Algorithmics,Mathematical analysis,Computer science,Computability theory,Computability,Model of computation,Turing,Ingenuity,Interactive computation,Computational complexity theory | Journal |

Volume | Issue | ISSN |

215 | 4 | Applied Mathematics and Computation |

Citations | PageRank | References |

8 | 0.86 | 16 |

Authors | ||

1 |

Authors (1 rows)

Cited by (8 rows)

References (16 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

S. Barry Cooper | 1 | 586 | 85.71 |