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, J
  • Schilling, A
  • Silva, PV
  • et al.
Abstract

© 2016 World Scientific Publishing Company. 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 (-ω)-resets. We mention how this opens new avenues to attack the vs. NP problem.

Main Content
Current View