Computability / CONCEPT
Counted stack-to-tape simulation
Counted stack-to-tape simulation.
Closed
DIRECT PREREQUISITES5
DIRECT CONSEQUENCES2
PROOF DEPTH4
DOCUMENT LINKS0
controller_simulates
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
- Blank-padding equivalence of tape executionstructural-affinity · Closed
- Boolean register regions on a tapestructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Executed word operationsstructural-affinity · Closed
- Finite binary tape machinesstructural-affinity · Closed
- Finite program algebra and compilationstructural-affinity · Closed
- Initialization of encoded Boolean registersstructural-affinity · Closed
- Kagey's Binary Null Polynomial Recurrencestructural-affinity · Closed
- Physical stack deletionstructural-affinity · Closed
- Physical tape insertion and deletionstructural-affinity · Closed
- Tape execution inside finite stacksstructural-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