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

From MaRDI portal
scientific article
Language Label Description Also known as
English
Simplicity via provability for universal prefix-free Turing machines
scientific article

    Statements

    Simplicity via provability for universal prefix-free Turing machines (English)
    0 references
    0 references
    10 January 2011
    0 references
    0 references
    universal Turing machine
    0 references
    provability
    0 references
    simplicity
    0 references
    0 references
    0 references
    0 references