Computability / CONCEPT
Uniform numerical clocks and output bounds
Uniform numerical clocks and output bounds.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH2
DOCUMENT LINKS0
polyTime_output_length
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
- Complexity classes in one concrete machine modelstructural-affinity · Closed
- Exact total ordered pair decodingstructural-affinity · Closed
- Finite Boolean stack machinesstructural-affinity · Closed
- Initialization of encoded Boolean registersstructural-affinity · Closed
- Natural sequences as legal infinite digitsstructural-affinity · Closed
- Numerical polynomial envelopesstructural-affinity · Closed
- Unary outer-length prefixesstructural-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