Reconciling Shannon and Scott with a Lattice of Computable Information

on YouTube ↗24m

" summary

Introduces a concrete construction called the Lattice of Computable Information whose elements are complete preorders (equivalence classes ordered by definedness) rather than Shannon partitions and whose lattice operations match Shannon’s but exclude kernels that cannot arise from computable functions, so the new lattice is roughly the same size yet computationally meaningful; combines Shannon’s lattice, Scott domain theory and power‑domain ideas and yields a first general formulation of termination‑insensitive non‑interference that the paper demonstrates on examples.

AI-written summary · about

" chapters (12)

1. 0:00Introduction
2. 1:06Shannon and Scott theories
3. 3:53Shannon’s lattice theory
4. 7:04Ordering information elements
5. 9:12Partitions and equivalence
6. 11:59Generalizing information flow
7. 13:44Shannon’s abstraction limits
8. 15:50Computable information lattice
9. 17:19Lattice structure
10. 18:25Termination sensitive non-interference
11. 19:28Summary
12. 20:13Q&A