Algebraic aspects of the computably enumerable degrees.
A set A of nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. The class of sets B which contain the same information as A under Turing computability (</=T) is the (Turing) degree of A, and a degree is...
Na minha lista:
| Publicado no: | Proc Natl Acad Sci U S A |
|---|---|
| Principais autores: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
National Academy of Sciences
1995
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.govhttps://pmc.ncbi.nlm.nih.gov/articles/PMC42793/ https://ncbi.nlm.nih.govhttps://pubmed.ncbi.nlm.nih.gov/11607508/ https://ncbi.nlm.nih.govhttps://doi.org/10.1073/pnas.92.2.617 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|