Pf ≠ NPf for almost all f (Q4434508)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2002119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pf ≠ NPf for almost all f |
scientific article; zbMATH DE number 2002119 |
Statements
Pf ≠ NPf for almost all f (English)
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
0.8263958096504211
0 references
0.8024623990058899
0 references
0.7949870824813843
0 references
0.771548330783844
0 references
