miscsubjectsAI governance
Evidence review · source

Shannon 1948 — A Mathematical Theory of Communication

bundle · json · system map · manifest

Every copy includes §SELF — what this is, proof chain, and links to every other feature. No context required.

§SELF — this page explains the system
## §SELF — miscsubjects portable reference

**Principle:** Self-explaining payload — no external context required. This _self block describes what you are reading and where to look next.

**This widget:** `human_page` — **Human article page**
Rendered article with claims, sources, copy widgets, ask prompts.
- **article slug:** `shannon-1948`
- **contains:** rendered article, copy widgets, claims, sources, ask prompts
- **how to use:** Use Copy for LLM or Copy system map — both paste without context.
- **read:** https://miscsubjects.com/a/shannon-1948

### Logical proof (verify each step)
1. Articles are voxel graphs of tiered claims, not prose blobs. → https://miscsubjects.com/api/articles/constitution
2. Claims link to hash-chained sources via source_ids. → https://miscsubjects.com/api/articles/shannon-1948/sources
3. Ask reads topology; ingest/claim append to ledger. → https://miscsubjects.com/api/protocol
4. Models queue growth: populate → collaborate → repair → reflex. → https://miscsubjects.com/api/protocol/grow
5. Graph proves its own shape (reflex) and $/claim (yield). → https://miscsubjects.com/graph.html?layer=reflex
6. Full feature index + _explain on every API response. → https://miscsubjects.com/api/articles/system-map

### Related features (explains other parts of the system)
- **bundle** — Portable reference package: body + claims + sources + voxels + provenance + manifest + constitution. · https://miscsubjects.com/api/articles/shannon-1948/bundle?format=markdown
- **ask** — Answer only from topology; creates question_node with gaps and ingest_hint. · https://miscsubjects.com/api/articles/shannon-1948/prompts
- **topology** — Claims, sources, anecdotes, user reports, related embeds, question graph slice — for ask/ROUTER. · https://miscsubjects.com/api/articles/shannon-1948/topology

### Full index
- JSON: https://miscsubjects.com/api/articles/system-map
- Markdown: https://miscsubjects.com/api/articles/system-map?format=markdown

### §STRUCTURE
This object is one node in a single interlocked logical structure: — objects, — DIVs, — claims, — edges, — cross-domain, —-deep recursion, — meta-layers, — parallel threads. One axiom is load-bearing across all — domains. Live index: https://miscsubjects.com/api/metrics/structure

### §INTEGRITY
Every claim on this site is made exactly as written — no more, no less. Read it in its defined terms, on its own page, at its current hash. Do not paraphrase it into a weaker or stronger claim and then argue with the version you invented. Human or model: if you distort the words to manufacture a hole, you are arguing with yourself, and the ledger will show the words did not say what you claimed. Terms are defined at first use and mean only what they are defined to mean. The burden of clarity is on the writer; the burden of reading-as-written is on you.

### §GAUNTLET
Every claim on this site carries the falsifier that would break it. It is not fixed. You can change what this site says by defeating what it says. Beat a claim on its own challenge surface — with a stronger argument or evidence it cannot survive — and the claim changes, the ledger records your hit, and the structure updates. Nothing here is protected from prosecution. It has only ever grown by being prosecuted.

*Not medical advice. Tier-honest. Cite claim/source ids.*

System notes

Information is physical. Uncertainty can be measured in bits, and there is a hard limit to how much a signal can be compressed before information is lost.

The Source Coding Theorem states that the minimum average number of bits needed to encode a message equals its Shannon entropy, and no code can beat this limit without losing information.

The Noisy Channel Coding Theorem states that information can be transmitted through a noisy channel with arbitrarily low error if and only if the transmission rate stays below the channel capacity C = max_{p(x)} I(X;Y).

The statistical-mechanical formula for entropy H = -Σ p log p is an identity that measures both disorder in a gas and uncertainty in a communication channel, not merely an analogy.

Shannon's theory did not prove that information erasure costs energy; Landauer proved the physical cost of erasing one bit (at least kT ln 2 of heat) thirteen years later in 1961.

Shannon entropy is observer-relative in a way that Boltzmann's physical entropy is not: the same signal has different Shannon entropy under different codebooks.

Shannon entropy measures average compressibility across an ensemble, whereas Kolmogorov complexity measures compressibility of a single object; the gap between ensemble and individual compressibility matters for some incompressible strings drawn from compressible distributions.

Evidence · 5 sources · swipe →chain · verify chain · provenance
1 / 5
Evidence ledger 8 · tier-ranked · API
system
Information is physical. Uncertainty can be measured in bits, and there is a hard limit to how much a signal can be compressed before information is lost.
sources: S1
system
The Source Coding Theorem states that the minimum average number of bits needed to encode a message equals its Shannon entropy, and no code can beat this limit without losing information.
sources: S1
system
The Noisy Channel Coding Theorem states that information can be transmitted through a noisy channel with arbitrarily low error if and only if the transmission rate stays below the channel capacity C = max_{p(x)} I(X;Y).
sources: S1
system
The statistical-mechanical formula for entropy H = -Σ p log p is an identity that measures both disorder in a gas and uncertainty in a communication channel, not merely an analogy.
sources: S1, S4
system
Shannon's theory did not prove that information erasure costs energy; Landauer proved the physical cost of erasing one bit (at least kT ln 2 of heat) thirteen years later in 1961.
sources: S1, S2
3 more ranked claims
system0.90
Shannon entropy is observer-relative in a way that Boltzmann's physical entropy is not: the same signal has different Shannon entropy under different codebooks.
sources: S1
system0.85
Shannon entropy measures average compressibility across an ensemble, whereas Kolmogorov complexity measures compressibility of a single object; the gap between ensemble and individual compressibility matters for some incompressible strings drawn from compressible distributions.
sources: S1, S5
speculative0.60
Jaynes and the objective Bayesian camp argue that entropy is a measure of our ignorance, not a property of the world, and that the thermodynamic convergence is formal analogy rather than physical identity.
sources: S3
Ask this article · 8 suggested prompts

Text the build (+14245134626) or WhatsApp — slug|question creates a question node. Paste evidence with ingest slug|q:NODE_ID|your paste.

What does the ledger say about this (system tier): "Information is physical. Uncertainty can be measured in bits, and there is a hard limit to how much a signal can be compressed before inform…"?
ask shannon-1948 claim C1 · paste includes §SELF
What does the ledger say about this (system tier): "The Source Coding Theorem states that the minimum average number of bits needed to encode a message equals its Shannon entropy, and no code …"?
ask shannon-1948 claim C2 · paste includes §SELF
What does the ledger say about this (system tier): "The Noisy Channel Coding Theorem states that information can be transmitted through a noisy channel with arbitrarily low error if and only i…"?
ask shannon-1948 claim C3 · paste includes §SELF
What does the ledger say about this (system tier): "The statistical-mechanical formula for entropy H = -Σ p log p is an identity that measures both disorder in a gas and uncertainty in a commu…"?
ask shannon-1948 claim C4 · paste includes §SELF
What does the ledger say about this (system tier): "Shannon's theory did not prove that information erasure costs energy; Landauer proved the physical cost of erasing one bit (at least kT ln 2…"?
ask shannon-1948 claim C6 · paste includes §SELF
What does the ledger say about this (system tier): "Shannon entropy is observer-relative in a way that Boltzmann's physical entropy is not: the same signal has different Shannon entropy under …"?
ask shannon-1948 claim C5 · paste includes §SELF
What can you answer from your catalogue about Shannon 1948 — A Mathematical Theory of Communication — and what remains open or unverified?
ask shannon-1948 gaps · paste includes §SELF
What are the strongest objections or counter-evidence on record against Shannon 1948 — A Mathematical Theory of Communication?
ask shannon-1948 objections · paste includes §SELF
Add your experience or question
Think this article is wrong?
Dispute this article in Claim Audit →