'Viral' Turing Machines, Computation from Noise and Combinatorial Hierarchies
arXiv:1702.06000 · doi:10.1016/j.chaos.2017.09.033
Abstract
The interactive computation paradigm is reviewed and a particular example is extended to form the stochastic analog of a computational process via a transcription of a minimal Turing Machine into an equivalent asynchronous Cellular Automaton with an exponential waiting times distribution of effective transitions. Furthermore, a special toolbox for analytic derivation of recursive relations of important statistical and other quantities is introduced in the form of an Inductive Combinatorial Hierarchy.
24 p., 4 figures