The universal rewrite system coded

Rowlands, Sydney and Rowlands, Peter (2022) The universal rewrite system coded. .

Access the full-text of this item by clicking on the Open Access link.

Official URL: http://dx.doi.org/10.1088/1742-6596/2197/1/012023

Abstract

<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>

Item Type:	Conference or Workshop Item (Unspecified)
Divisions:	Faculty of Science and Engineering > School of Physical Sciences
Depositing User:	Symplectic Admin
Date Deposited:	19 May 2022 13:46
Last Modified:	18 Jan 2023 21:01
DOI:	10.1088/1742-6596/2197/1/012023
Open Access URL:	https://iopscience.iop.org/article/10.1088/1742-65...
Related URLs:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3155121