Algorithmic complexity of algebraic systems (Q1121875)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Algorithmic complexity of algebraic systems
scientific article

    Statements

    Algorithmic complexity of algebraic systems (English)
    0 references
    0 references
    1988
    0 references
    See the review in Zbl 0664.03032.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    construcible structure
    0 references
    classification of algebraic systems by Turing degrees of unsolvability
    0 references
    degree of constructibility
    0 references
    m-degrees of recursively enumerable sets
    0 references
    strong constructibility
    0 references
    0 references