Name
Abstract | ||
|---|---|---|
We introduce a formal definition of Wolfram's notion of computational process based on cellular automata, a physics-like model of computation. There is a natural classification of these processes into decidable, intermediate and complete. It is shown that in the context of standard finite injury priority arguments one cannot establish the existence of an intermediate computational process. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.4204/EPTCS.1.22 | ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE |
Keywords | Field | DocType |
cellular automata,model of computation,computational complexity | Discrete mathematics,Cellular automaton,Asymptotic computational complexity,Automata theory,Computer science,Decidability,Theoretical computer science,Computational model,Model of computation,Computational resource,Theory of computation | Journal |
Volume | Issue | ISSN |
1 | 1 | 2075-2180 |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Klaus Sutner | 1 | 119 | 19.42 |