ConceptDynamics / CONCEPT
Finite response tables
Finite response tables compute least forgetting depths and deterministic sorted quotient sections for numbered incoming lifts.
Closed
DIRECT PREREQUISITES2
DIRECT CONSEQUENCES1
PROOF DEPTH5
DOCUMENT LINKS0
Complete finite response and quotient refinement
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
- Actual lift fibers and response countsstructural-affinity · Closed
- Chronological dynamics of actual outgoing liftsstructural-affinity · Closed
- Dynamics of actual response quotientsstructural-affinity · Closed
- Exact forgetting and common nilpotencystructural-affinity · Closed
- Exact memory and bounded periodic collisionsstructural-affinity · Closed
- Independent actual forgetting depthsstructural-affinity · Closed
- Minimum Rational Dimension of the Fibonacci Parity Liftstructural-affinity · Closed
- Original BDR Proposition 3.4structural-affinity · Closed
- Original theorem 6.2structural-affinity · Closed
- Quantitative exchange tracesstructural-affinity · Closed
- Response kernel successorstructural-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