Computability / CONCEPT
Blank-padding equivalence of tape execution
Blank-padding equivalence of tape execution.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH1
DOCUMENT LINKS0
run_some_of_equivalent
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
- Boolean register regions on a tapestructural-affinity · Closed
- Complexity classes in one concrete machine modelstructural-affinity · Closed
- Counted stack-to-tape simulationstructural-affinity · Closed
- Finite binary tape machinesstructural-affinity · Closed
- Finite Boolean stack machinesstructural-affinity · Closed
- Finite program algebra and compilationstructural-affinity · Closed
- Initialization of encoded Boolean registersstructural-affinity · Closed
- Numerical polynomial envelopesstructural-affinity · Closed
- Physical stack deletionstructural-affinity · Closed
- Physical tape insertion and deletionstructural-affinity · Closed
- Uniform numerical clocks and output boundsstructural-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