Algebraic aspects of the computably enumerable degrees.
AUTOR(ES)
Slaman, T A
RESUMO
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 (
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=42793Documentos Relacionados
- Survival of fetal rat pancreases frozen to -78 and -196 degrees.
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
- Regulation of RNA polymerase synthesis in Escherichia coli: a mutant unable to synthesize the enzyme at 43 degrees.
- Post's program and incomplete recursively enumerable sets.
- Ways of reading and saying of the subject: parafrasis, interpretation gestures and authorship in language and pedagogy degrees.
