## Computational Processes, Observers and Turing Incompleteness

by
Klaus Sutner

Citations: | 1 - 1 self |

### BibTeX

@MISC{Sutner_computationalprocesses,,

author = {Klaus Sutner},

title = {Computational Processes, Observers and Turing Incompleteness},

year = {}

}

### OpenURL

### Abstract

We propose a formal definition of Wolfram’s notion of computational process 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.