Random sequence generation by cellular automata
Advances in Applied Mathematics
An alternative, priority-free, solution to Post's problem
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Classifying circular cellular automata
Physica D
Mechanism for computing over arbitrary structures
The universal Turing machine (2nd ed.)
A new kind of science
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Cellular automata and intermediate degrees
Theoretical Computer Science
Two-state, reversible, universal cellular automata in three dimensions
Proceedings of the 2nd conference on Computing frontiers
An explicit solution to Post's Problem over the reals
Journal of Complexity
| Hi-index | 5.23 |
We propose a formal definition of Wolfram's notion of computational processes based on iterated transducers together with a weak observer, a model of computation that captures some aspects of physics-like computation. These processes admit a natural classification into decidable, intermediate and complete, where intermediate processes correspond to recursively enumerable sets of intermediate degree in the classical setting. It is shown that a standard finite injury priority argument will not suffice to establish the existence of an intermediate computational process.