Wide machines are complete for NEXPTIME and EXPSPACE
Lax822549.WideMachinesComplete · concepts/Lax822549/WideMachinesComplete.lean · lax-822549
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Wide acceptance is in NEXPTIME, and wide acceptance with a regular channel is NEXPTIME-complete: a wide machine is an ordinary machine read over an exponential expansion, and hardness lays the computation of a problem of NEXPTIME out along the addresses, block by block. Wide acceptance in space is EXPSPACE-complete, deterministic or not. The three wide acceptance problems have yes-instances.
Concept map
Evidence
This concept declares 7 statements. Each proof establishes one of them relative to its assumptions.
1 dwideAcceptSpace_EXPSPACE_complete proven
2 dwideAcceptSpace_nonvacuous proven
3 wideAccept_mem_NEXPTIME proven
4 wideAccept_nonvacuous proven
5 wideAcceptSpace_EXPSPACE_complete proven
6 wideAcceptSpace_nonvacuous proven
7 wideRegAccept_NEXPTIME_complete proven
Lean source view on GitHub
| 1 | import Lax904597.Problems |
| 2 | import Lax904597.Classes |
| 3 | import Lax904597.Machines |
| 4 | import Lax485149.Problems |
| 5 | import Lax535992.DeterministicMachines |
| 6 | import Lax134656.SpaceBoundedMachines |
| 7 | import Lax480241.ExponentialClasses |
| 8 | import Lax822549.WideMachines |
| 9 | import Lax822549.WideRegChannel |
| 10 | import Lax822549.WideTilings |
| 11 | |
| 12 | /-! |
| 13 | --- |
| 14 | title: Wide machines are complete for NEXPTIME and EXPSPACE |
| 15 | type: theorem |
| 16 | --- |
| 17 | Wide acceptance is in NEXPTIME, and wide acceptance with a regular channel |
| 18 | is NEXPTIME-complete: a wide machine is an ordinary machine read over an |
| 19 | exponential expansion, and hardness lays the computation of a problem of |
| 20 | NEXPTIME out along the addresses, block by block. Wide acceptance in space |
| 21 | is EXPSPACE-complete, deterministic or not. The three wide acceptance |
| 22 | problems have yes-instances. |
| 23 | -/ |
| 24 | |
| 25 | namespace Lax822549.WideMachinesComplete |
| 26 | |
| 27 | open FirstOrder FirstOrder.Language |
| 28 | open Lax904597.Problems Lax904597.Classes Lax904597.Machines Lax485149.Problems |
| 29 | Lax480241.ExponentialClasses |
| 30 | open Lax822549.WideMachines Lax822549.WideRegChannel Lax822549.WideTilings |
| 31 | |
| 32 | /-- Wide acceptance is in NEXPTIME. -/ |
| 33 | axiom wideAccept_mem_NEXPTIME : |
| 34 | NEXPTIME.Mem WideAccept |
| 35 | |
| 36 | /-- Wide acceptance with a regular channel is NEXPTIME-complete. -/ |
| 37 | axiom wideRegAccept_NEXPTIME_complete : |
| 38 | NEXPTIME.Complete WideRegAccept |
| 39 | |
| 40 | /-- Wide acceptance in space is EXPSPACE-complete. -/ |
| 41 | axiom wideAcceptSpace_EXPSPACE_complete : |
| 42 | EXPSPACE.Complete WideAcceptSpace |
| 43 | |
| 44 | /-- Deterministic wide acceptance in space is EXPSPACE-complete. -/ |
| 45 | axiom dwideAcceptSpace_EXPSPACE_complete : |
| 46 | EXPSPACE.Complete DWideAcceptSpace |
| 47 | |
| 48 | /-- WideAccept has a finite yes-instance. -/ |
| 49 | axiom wideAccept_nonvacuous : |
| 50 | ∃ (A : Type) (_ : wide.Structure A), Finite A ∧ WideAccept A |
| 51 | |
| 52 | /-- WideAcceptSpace has a finite yes-instance. -/ |
| 53 | axiom wideAcceptSpace_nonvacuous : |
| 54 | ∃ (A : Type) (_ : wide.Structure A), Finite A ∧ WideAcceptSpace A |
| 55 | |
| 56 | /-- DWideAcceptSpace has a finite yes-instance. -/ |
| 57 | axiom dwideAcceptSpace_nonvacuous : |
| 58 | ∃ (A : Type) (_ : wide.Structure A), Finite A ∧ DWideAcceptSpace A |
| 59 | |
| 60 | end Lax822549.WideMachinesComplete |
| 61 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments