Please use this identifier to cite or link to this item:
https://hdl.handle.net/10216/110900| Author(s): | Pedro V. Silva John Rhodes Anne Schilling |
| Title: | The semaphore codes attached to a Turing machine via resets and their various limits |
| Issue Date: | 2016 |
| 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. |
| URI: | https://hdl.handle.net/10216/110900 |
| Document Type: | Artigo em Revista Científica Internacional |
| Rights: | openAccess |
| Appears in Collections: | FCUP - Artigo em Revista Científica Internacional |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 215023.pdf | 342.04 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.