The semaphore codes attached to a Turing machine via resets and their various limits
John Rhodes, Anne Schilling, Pedro V. Silva · International Journal of Algebra and Computation · 2016
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 [Formula: see text]-resets to obtain [Formula: see text]-resets. We mention how this opens new avenues to attack the vs. NP problem.