The Complexity of Quickly ORM-Decidable Sets (Q5425351)

From MaRDI portal
scientific article; zbMATH DE number 5211279
Language Label Description Also known as
English
The Complexity of Quickly ORM-Decidable Sets
scientific article; zbMATH DE number 5211279

    Statements

    The Complexity of Quickly ORM-Decidable Sets (English)
    0 references
    0 references
    0 references
    0 references
    13 November 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    ordinal computation
    0 references
    infinite time computation
    0 references
    computability
    0 references
    register machine
    0 references
    arithmetical hierarchy
    0 references
    hyperarithmetical hierarchy
    0 references
    complexity
    0 references
    0 references