P ≠ NP ∩ co-NP for Infinite Time Turing Machines (Q3374094)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | P ≠ NP ∩ co-NP for Infinite Time Turing Machines |
scientific article |
Statements
P ≠ NP ∩ co-NP for Infinite Time Turing Machines (English)
0 references
9 March 2006
0 references
complexity theory
0 references
descriptive set theory
0 references
