We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The semaphore codes attached to a Turing machine via resets and their various limits.
- Authors
Rhodes, John; Schilling, Anne; Silva, Pedro V.
- 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 vs. NP problem.
- Subjects
TURING machines; LIMITS (Mathematics); APPROXIMATION theory; RANDOM walks; NP-hard problems
- Publication
International Journal of Algebra & Computation, 2016, Vol 26, Issue 4, p675
- ISSN
0218-1967
- Publication type
Article
- DOI
10.1142/S0218196716500296