TotalVariation / CONCEPT
Unique parsing of complete Parry runs
Prefix freedom of the actual Parry run words at each fixed run count.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES1
PROOF DEPTH8
DOCUMENT LINKS1
Prefix-free run words
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
- A shared-rule defect requires a boundary eventstructural-affinity · Closed
- Actual mixing and complete-prefix comparisonstructural-affinity · Closed
- Autonomous prediction and observation entropystructural-affinity · Closed
- Boundary selection from actual run cylindersstructural-affinity · Closed
- Complete zero runs and the shared window rulestructural-affinity · Closed
- Conditional Parry words and collisionsstructural-affinity · Closed
- Dominance Memory for Actual Binary Windowsstructural-affinity · Closed
- Exact State and Bit Counts for the Binary Shiftstructural-affinity · Closed
- Finite Parry window upper boundsstructural-affinity · Closed
- Mixing and measurable selection for the bilateral Parry sourcestructural-affinity · Closed
- Twisted Rotation and Parry Window Defectsstructural-affinity · Closed
- Uniform stationary defect of the shared rulestructural-affinity · Closed
- Zero-Run Word Geometrystructural-affinity · Closed
Documents & exposition
Other authored & advisory relationships
None recorded in this release.
LIBRARY / RELEASE VERSIONS
Content history
Loading release versions...
Browse the archiveCertified provenance