trureturingGitHub MATHEMATICAL ATLAS

Computability / CONCEPT

Unary outer-length prefixes

Unary outer-length prefixes.

Closed Authored exposition
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES2
PROOF DEPTH2
DOCUMENT LINKS0
THEOREM

SAT.readNat_eq_some

RELATIONSHIP ATLAS

Every connection, in context.

Explore in 3D
Direct recorded relationships
Complexity classes in one concrete machine modelComplexity classes in oneconcrete machine modelUnary outer-length prefixesUnary outer-length prefixesPrimitive unary-prefix parsingPrimitive unary-prefix parsingNatural sequences as legal infinite digitsNatural sequences as legalinfinite digits
Proof dependencyStructural affinityDocument link

RELATED KNOWLEDGE

Structural connections

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 archive

Certified provenance

Exact release coordinate

Lean sourceResearch workspace
Status
Closed
Depth
2
Layer
D5/S0
Domain
Computability
Node ID
D5/S0/Computability/BinaryMachine/UnaryWords
Repository path
D5/S0/Computability/BinaryMachine/UnaryWords.lean
Truth release
sha256:76a8db6a0f78609b1b9d4a959c8392f2752f2daaddc1930e046e34ce07d0f608
Source commit
b52262a023c4db9bb30a128ebfd80ea4ef4c1a53
Source tree
37a24ddf3b9983bdabf0acbfd9b32b06c35c28d3

Authority boundary

Dependency edges, status, and source coordinates come from the verified release and certified topology. Blueprint exposition is labeled separately. A fallback title carries no additional mathematical authority.