Computability / CONCEPT
Primitive unary-prefix parsing
Primitive unary-prefix parsing.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH4
DOCUMENT LINKS0
exec_readUnary_encoded
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
- An executed ordered pair constructorstructural-affinity · Closed
- Decision continuations and exact word movementstructural-affinity · Closed
- Exact original guarded clause languagesstructural-affinity · Closed
- Exact total ordered pair decodingstructural-affinity · Closed
- Executed word operationsstructural-affinity · Closed
- Natural sequences as legal infinite digitsstructural-affinity · Closed
- Register injection and disjoint framesstructural-affinity · Closed
- Tape execution inside finite stacksstructural-affinity · Closed
- Unary outer-length prefixesstructural-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