Recursively enumerable complexity sequences and measure independence (Q3901505)

From MaRDI portal
Revision as of 11:32, 13 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recursively enumerable complexity sequences and measure independence
scientific article

    Statements

    title
    Recursively enumerable complexity sequences and measure independence (English)
    0 references
    DOI
    10.2307/2273412
    0 references
    author
    Victor L. Bennison
    0 references
    publication date
    1980
    0 references
    Mathematics Subject Classification ID
    03D15
    0 references
    68Q25
    0 references
    03D30
    0 references
    zbMATH DE Number
    3710159
    0 references
    zbMATH Keywords
    abstract computational complexity
    0 references
    complexity measure
    0 references
    OpenAlex ID
    W2063202211
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3901505&oldid=34647974"
    Powered by MediaWiki