Computability / CONCEPT
Finite Boolean stack machines
Finite Boolean stack machines.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH1
DOCUMENT LINKS0
runInput_length_le
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
- Complexity classes in one concrete machine modelstructural-affinity · Closed
- Executed word operationsstructural-affinity · Closed
- Finite binary tape machinesstructural-affinity · Closed
- Finite program algebra and compilationstructural-affinity · Closed
- Physical stack deletionstructural-affinity · Closed
- Physical tape insertion and deletionstructural-affinity · Closed
- Unary outer-length prefixesstructural-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