  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.
