Manuscript Psy04-B@1 · Psy04-B-v1.tex · proposition · 62c2b6f0

Proposition: Storage processing cannot improve a fixed classical encoder's optimum

The sharp classical benchmark on the cut · lines 912–924 · proof included or linked

Psy04-B@1#prop:classicaldelay

For a fixed encoder and an input-independent admitted classical storage kernel, optimal post-storage decoding cannot exceed optimal decoding from the pre-storage state.

Proof. A decoder given the pre-storage state can simulate the storage kernel internally and then use any post-storage decoder.

Nearby in this section

section: The sharp classical benchmark on the cut
lemma: Lemma: Deterministic-table reduction
section: The sharp classical benchmark on the cut
theorem: Theorem: Sharp two-state classical bound
section: The sharp classical benchmark on the cut
section: The sharp classical benchmark on the cut