The computational strengths of \(\alpha\)-tape infinite time Turing machines (Q2453073)

From MaRDI portal
Revision as of 18:35, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
The computational strengths of \(\alpha\)-tape infinite time Turing machines
scientific article

    Statements

    The computational strengths of \(\alpha\)-tape infinite time Turing machines (English)
    0 references
    0 references
    6 June 2014
    0 references
    infinite-time Turing machine
    0 references
    ordinal computability
    0 references
    supertask
    0 references
    transfinite computation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references