Name
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 setup 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 vs. NP problem. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1142/S0218196716500296 | INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION |
Keywords | Field | DocType |
P vs. NP problem, profinite limit, resets, semaphore codes, Turing machines | Discrete mathematics,Semaphore,Algebra,Random walk,Approximation theory,P versus NP problem,Turing machine,De Bruijn sequence,Mathematics | Journal |
Volume | Issue | ISSN |
26 | 4 | 0218-1967 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| John L. Rhodes | 1 | 20 | 3.11 |
| Anne Schilling | 2 | 17 | 6.74 |
| Pedro V. Silva | 3 | 141 | 29.42 |