Complexity Bounds for Ordinal-Based Termination (Q3447691)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Complexity Bounds for Ordinal-Based Termination
scientific article

    Statements

    Complexity Bounds for Ordinal-Based Termination (English)
    0 references
    0 references
    28 October 2015
    0 references
    fast-growing complexity
    0 references
    length-function theorem
    0 references
    Ramsey-based termination
    0 references
    ranking function
    0 references
    well-quasi-order
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references