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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , , |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Providence, RI :
American Mathematical Society,
[2020].
|
| Colección: | Memoirs of the American Mathematical Society ;
no. 1284. |
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | 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 weaker notions of reducibility, such as weak truth table reducibility or Turing reducibility, it is not possible to combine these properties in a single degree. We consider how minimal weak truth table degrees interact with computably enumerable Turing degrees and obtain three main results. First, the. |
|---|---|
| Notas: | "May 2020" per title page. |
| Descripción Física: | 1 online resource (vii, 90 pages) : illustrations. |
| Bibliografía: | Includes bibliographical references. |
| ISBN: | 9781470461379 1470461374 9781470461362 1470461366 |