Beschreibung:
<jats:title>Abstract</jats:title>
<jats:p>The universal rewrite system (URS), first formulated by Rowlands and Diaz [2002], which may well be the meta-pattern driving the systems of the physical universe, has been realized, in the companion paper, in the deterministic Turing machine and other devices foundational to computational theory. Here, we show that we can extend the results to actual coding of a given finite section of the fundamentally infinite system. We also apply the principle of the URS to the universal Turing machine and to variable finite automata over an infinite alphabet, and explain its use in cryptography and the decision problem.</jats:p>