Simplicity via provability for universal prefix-free Turing machines (Q616504)

From MaRDI portal
Revision as of 15:48, 3 July 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
Simplicity via provability for universal prefix-free Turing machines
scientific article

    Statements

    title
    Simplicity via provability for universal prefix-free Turing machines (English)
    0 references
    author
    Cristian S. Calude
    0 references
    publication date
    10 January 2011
    0 references
    zbMATH DE Number
    5834262
    0 references
    zbMATH Keywords
    universal Turing machine
    0 references
    provability
    0 references
    simplicity
    0 references
    OpenAlex ID
    W2963427251
    0 references
    Wikidata QID
    Q57001536
    0 references
    arXiv ID
    0906.3235
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q616504&oldid=35207851"
    Powered by MediaWiki