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...
Gorde:
| Argitaratua izan da: | Proc Natl Acad Sci U S A |
|---|---|
| Egile Nagusiak: | , |
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
National Academy of Sciences
1995
|
| Gaiak: | |
| Sarrera elektronikoa: | 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 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|