Kolmogorov complexity and computably enumerable sets (Q490655)

From MaRDI portal
Revision as of 15:17, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Kolmogorov complexity and computably enumerable sets
scientific article

    Statements

    title
    Kolmogorov complexity and computably enumerable sets (English)
    0 references
    author
    George Barmpalias
    0 references
    Ang Sheng Li
    0 references
    publication date
    27 August 2015
    0 references
    Mathematics Subject Classification ID
    03D30
    0 references
    03D32
    0 references
    68Q30
    0 references
    03D80
    0 references
    zbMATH DE Number
    6476478
    0 references
    zbMATH Keywords
    computably enumerable sets
    0 references
    Kolmogorov complexity
    0 references
    relativization
    0 references
    OpenAlex ID
    W2964261109
    0 references
    arXiv ID
    1111.4339
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q490655&oldid=33320247"
    Powered by MediaWiki