The semaphore codes attached to a Turing machine via resets and their various limits
Skip to main content
eScholarship
Open Access Publications from the University of California

The semaphore codes attached to a Turing machine via resets and their various limits

  • Author(s): Rhodes, John
  • Schilling, Anne
  • Silva, Pedro V.
  • et al.

Published Web Location

https://arxiv.org/pdf/1604.00959.pdf
No data is associated with this publication.
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 $k$-resets to obtain $(-\omega)$-resets. We mention how this opens new avenues to attack the P versus NP problem.

Item not freely available? Link broken?
Report a problem accessing this item