Name
Abstract | ||
|---|---|---|
We explore several concepts for analyzing the intuitive notion of computational irreducibility and we propose a robust formal definition, first in the field of cellular automata and then in the general field of any computable function f from N to N. We prove that, through a robust definition of what means "to be unable to compute the nth step without having to follow the same path than simulating the automaton or the function", this implies genuinely, as intuitively expected, that if the behavior of an object is computationally irreducible, no computation of its nth state can be faster than the simulation itself. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-35482-3_19 | arXiv: Computational Complexity |
Keywords | Field | DocType |
complexity,computation,cellular automata | Cellular automaton,Discrete mathematics,Combinatorics,Computer science,Irreducibility,Computational irreducibility,Automaton,Formal description,Logical depth,Computable function,Computation | Journal |
Volume | Citations | PageRank |
abs/1111.4121 | 1 | 0.41 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hervé Zwirn | 1 | 6 | 1.20 |
| Jean-Paul Delahaye | 2 | 325 | 54.60 |