Cargando…
Minimal weak truth table degrees and computably enumerable turing degrees
Two of the central concepts for the study of degree structures in computability theory are computably enumerable degrees and minimal degrees. For strong notions of reducibility, such as m-deducibility or truth table reducibility, it is possible for computably enumerable degrees to be minimal. For we...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
American Mathematical Society
2020
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/2744816 |