Computational complexity of recursively enumerable sets (Q4750632)

From MaRDI portal
Revision as of 17:12, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 3807599
Language Label Description Also known as
English
Computational complexity of recursively enumerable sets
scientific article; zbMATH DE number 3807599

    Statements

    title
    Computational complexity of recursively enumerable sets (English)
    0 references
    author
    Robert I. Soare
    0 references
    publication date
    1982
    0 references
    zbMATH Keywords
    recursively enumerable sets
    0 references
    complexity measure
    0 references
    degree
    0 references

    Identifiers

    zbMATH DE Number
    3807599
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4750632&oldid=28890305"
    Powered by MediaWiki