Pages that link to "Item:Q1408507"
From MaRDI portal
The following pages link to \(P\neq NP\) for infinite time Turing machines (Q1408507):
Displaying 6 items.
- Koepke machines and satisfiability for infinitary propositional languages (Q2011652) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- P ≠ NP ∩ co-NP for Infinite Time Turing Machines (Q3374094) (← links)
- SAFE RECURSIVE SET FUNCTIONS (Q3450802) (← links)
- Is P = PSPACE for Infinite Time Turing Machines? (Q3644798) (← links)
- <i>P</i> ≠ <i>NP</i> for all infinite Boolean algebras (Q4804182) (← links)
