finding

active

finding:delta-n-with-bayesian-order-is-a-domain-and-shannon-entropy-is-a-measurement

Delta^n with Bayesian order is a domain and Shannon entropy is a measurement

The set of classical probability distributions, ordered by Bayesian projections, forms a dcpo with least element the uniform distribution and max elements pure states; Shannon entropy is a measurement of type Delta^n -> [0,∞).

Source paper

extracted_from

Information, Processes and Games

Abramsky, Samson

Neighborhood — ranked by edge-count

Claims (1)

claim

The copy-cat strategy is a dynamic version of the tautology A∨¬A
supports
By playing both sides against an opponent and copying moves, one guarantees a win, mirroring the disjunction's logical structure in an interactive process.

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

Omega^n of quantum states with spectral order is a domain and von Neumann entropy is a measurementfinding0.836
Quantum density operators, ordered by common observable's classical Bayesian order, form a dcpo with max elements pure states; von Neumann entropy is a measurement.
Elements of domains form partially ordered information states where d ⊑ e means 'e conveys at least as much information as d'.finding0.734
Core intuition of Domain Theory: qualitative ordering of information states provides foundation for modeling computation without quantification.
Minimum entropy Markov blankets may characterize biological systems.claim0.727
Conjecture about what distinguishes living from non-living systems.
measurement on domains (Keye Martin)method0.718
Assigning real numbers to domain elements to measure degree of uncertainty, linking quantitative and qualitative views.
Free-energy scaling under domain-wall formation in Potts, autoregressive, and hierarchical networks shows that combinatorics of interactions on a graph prevent or allow spontaneous ordering.finding0.717
Core result demonstrating topological constraints on self-organization
A cannot measure the entanglement entropy across any internal boundary of its environment; it cannot verify that any part of the world it attends to is genuinely independent of everything else (Fields & Glazebrook 2023, Corollary 3.2)finding0.715
Generalises the self-evidence impossibility to all boundaries; grounds the teaching that all dharmas are empty
No finite system A can measure the entanglement entropy S(|AB>) across the boundary B that separates it from its environment B (Fields & Glazebrook 2023, Corollary 3.1)finding0.713
The core impossibility result imported from quantum information theory; basis of the entire argument
Partial orders naturally represent partial information states in computation.hypothesis0.711
Foundational hypothesis of Domain Theory: partial order structure (D, ⊑) captures information ordering without quantification.