ConceptDynamics / CONCEPT
Infinite Identification without Finite Exact Tomography
A countable transcript can identify two probability laws almost surely even though their coordinate laws are equivalent and no finite prefix admits an exact decoder.
Closed
DIRECT PREREQUISITES1
DIRECT CONSEQUENCES3
PROOF DEPTH4
DOCUMENT LINKS1
Almost-sure infinite identification has no finite exact converse
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
- Budget and First-Gap Geometry of Green Classesstructural-affinity · Closed
- Exact Diameter and Optimal Supports for Green Classesstructural-affinity · Closed
- Finite-Prefix and Infinite-Completion Separationstructural-affinity · Closed
- Finite-Prefix and Infinite-Completion Separationstructural-affinity · Closed
- Green-Class Mass and Naming Conservationstructural-affinity · Closed
- Green-Class Window Entropystructural-affinity · Closed
- Hausdorff Dimension of the Naming Space and Its Green Classesstructural-affinity · Closed
- Identifiability, Estimability, and Computationstructural-affinity · Closed
- Prefix-Law and Completion Separationstructural-affinity · Closed
- Sharp Radius of a Finite-Support Agreement Classstructural-affinity · Closed
- Varying-Marginal Green-Class Measurestructural-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