Automata / CONCEPT
Recurrent-State Conjugacy of First-Return Skeletons
Explicit recurrent-state equivalences preserve partial evaluation and canonical cost, allowing verified zero-map witnesses to cover the finite search.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES0
PROOF DEPTH4
DOCUMENT LINKS1
Transport every continuation
RELATIONSHIP ATLAS
Every connection, in context.
Direct recorded relationships
Proof dependencyStructural affinityDocument link
Certified topology / UPSTREAM
Prerequisites
Certified topology / DOWNSTREAM
Consequences
None recorded in this release.
RELATED KNOWLEDGE
Structural connections
- Binary Zeckendorf Block Codes and Transient Signaturesstructural-affinity · Closed
- Binary Zeckendorf First-Return Skeletonstructural-affinity · Closed
- Finite Sample Skeleton Totalization and Capacity Paddingstructural-affinity · Closed
- Finite Slot CNF for First-Return Skeletonsstructural-affinity · Closed
- Return Seeds Forced by Actual Reachabilitystructural-affinity · Closed
- Sample-Preserving Channel Retractionstructural-affinity · Closed
- Shared Zero Responses of Slot Skeletonsstructural-affinity · Closed
- SkeletonSlotProfileSymmetrystructural-affinity · Closed
- The First Fibonacci Delimiterstructural-affinity · Closed
- Trace Partition Refutationstructural-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