Computability / CONCEPT
Complexity classes in one concrete machine model
Complexity classes in one concrete machine model.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH1
DOCUMENT LINKS0
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
- Exact total ordered pair decodingstructural-affinity · Closed
- Finite binary tape machinesstructural-affinity · Closed
- Finite Boolean stack machinesstructural-affinity · Closed
- Finite program algebra and compilationstructural-affinity · Closed
- Natural sequences as legal infinite digitsstructural-affinity · Closed
- Numerical polynomial envelopesstructural-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