On the Complexity of Learning Minimum Time-Bounded Turing Machines (Q3357539)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the Complexity of Learning Minimum Time-Bounded Turing Machines
scientific article

    Statements

    On the Complexity of Learning Minimum Time-Bounded Turing Machines (English)
    0 references
    1991
    0 references
    generalized Kolmogorov complexity
    0 references
    NP-completeness
    0 references
    feasible learning theory
    0 references
    0 references

    Identifiers

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