The semaphore codes attached to a Turing machine via resets and their various limits
Group Theory
2016-07-08 v1
Abstract
We introduce semaphore codes associated to a Turing machine via resets. Semaphore codes provide an approximation theory for resets. In this paper we generalize the set-up of our previous paper "Random walks on semaphore codes and delay de Bruijn semigroups" to the infinite case by taking the profinite limit of -resets to obtain -resets. We mention how this opens new avenues to attack the P versus NP problem.
Cite
@article{arxiv.1604.00959,
title = {The semaphore codes attached to a Turing machine via resets and their various limits},
author = {John Rhodes and Anne Schilling and Pedro V. Silva},
journal= {arXiv preprint arXiv:1604.00959},
year = {2016}
}
Comments
28 pages; Sections 3-6 appeared in a previous version of arXiv:1509.03383 as Sections 9-12 (the split of the previous paper was suggested by the journal); Sections 1-2 and 7 are new