The homogeneity conjecture
We show that, for any function f in which Kleene's O is computable, the ordering of Turning degrees (i.e., degrees of difficulty of computation of functions) is not isomorphic to the ordering of degrees of functions from which f is computable. This refutes a well-known conjecture of H. Rogers, Jr.,...
Gardado en:
| Publicado en: | Proc Natl Acad Sci U S A |
|---|---|
| Autor Principal: | |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
National Academy of Sciences
1979
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC411543/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/16592707/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.76.9.4218 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|