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...
I tiakina i:
| I whakaputaina i: | Proc Natl Acad Sci U S A |
|---|---|
| Ngā kaituhi matua: | , |
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
National Academy of Sciences
1995
|
| Ngā marau: | |
| Urunga tuihono: | 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 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|