Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
