Abstract (EN):
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.
Idioma:
Inglês
Tipo (Avaliação Docente):
Científica
Nº de páginas:
30