Pages that link to "Item:Q3374094"
From MaRDI portal
The following pages link to P ≠ NP ∩ co-NP for Infinite Time Turing Machines (Q3374094):
Displaying 10 items.
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- \(P\neq NP\) for infinite time Turing machines (Q1408507) (← links)
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- Infinite-Time Turing Machines and Borel Reducibility (Q3576045) (← links)
- Is P = PSPACE for Infinite Time Turing Machines? (Q3644798) (← links)
- Limit, logic, and computation (Q4378032) (← links)
- <i>P</i> ≠ <i>NP</i> for all infinite Boolean algebras (Q4804182) (← links)
- Turing Machines with Atoms (Q5271055) (← links)