Computability / CONCEPT
Tape execution inside finite stacks
Tape execution inside finite stacks.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES3
PROOF DEPTH5
DOCUMENT LINKS0
simulate_core
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
RELATED KNOWLEDGE
Structural connections
- A total primitive witness-length comparisonstructural-affinity · Closed
- Boolean register regions on a tapestructural-affinity · Closed
- Composition of polynomial many-one reductionsstructural-affinity · Closed
- Counted stack-to-tape simulationstructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Executed polynomial transducer compositionstructural-affinity · Closed
- Executed word operationsstructural-affinity · Closed
- Initialization of encoded Boolean registersstructural-affinity · Closed
- Kagey's Binary Null Polynomial Recurrencestructural-affinity · Closed
- Physical stack deletionstructural-affinity · Closed
- Primitive unary-prefix parsingstructural-affinity · Closed
- Whole stack programs as polynomial tape machinesstructural-affinity · Closed
Documents & exposition
None recorded in this release.
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance