Ordinal recursive complexity of unordered data nets (Q529043)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Ordinal recursive complexity of unordered data nets
scientific article

    Statements

    Ordinal recursive complexity of unordered data nets (English)
    0 references
    18 May 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    data nets
    0 references
    ordinal recursive complexity
    0 references
    hyper-Ackermannian problems
    0 references
    fast-growing complexity hierarchy
    0 references
    multisets over \(\mathbb{N}^k\)
    0 references
    0 references