Pf ≠ NPf for almost all f (Q4434508)

From MaRDI portal
scientific article; zbMATH DE number 2002119
Language Label Description Also known as
English
Pf ≠ NPf for almost all f
scientific article; zbMATH DE number 2002119

    Statements

    Pf ≠ NPf for almost all f (English)
    0 references
    0 references
    0 references
    0 references
    10 November 2003
    0 references
    ordinal bounded computation
    0 references
    infinite time Turing machines
    0 references
    deterministic versus nondeterministic computation
    0 references
    recursion theory on real numbers
    0 references

    Identifiers

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