
TL;DR
This paper introduces an information-theoretic framework to analyze the capacity of unreliable, noisy computations, extending communication channel models to understand how reliably functions can be computed with noisy devices.
Contribution
It defines the capacity of noisy computation, provides coding theorems and converse results, and characterizes conditions for reliable computation using information theory.
Findings
Capacity bounds for noisy computation are established.
Reliable computation is achievable under certain encoding constraints.
Theoretical models extend to formal computational functions.
Abstract
This paper presents an analysis of the concept of capacity for noisy com- putations, i.e. functions implemented by unreliable or random devices. An information theoretic model of noisy computation of a perfect function f (measurable function between sequence spaces) thanks to an unreliable device (random channel) F is given: a noisy computation is a product fxF of channels. A model of reliable computation based on input encoding and output decoding is also proposed. These models extend those of noisy communication channel and of reliable communication through a noisy channel. The capacity of a noisy computation is defined and justified by a coding theorem and a converse. Under some constraints on the encoding process, capacity is the upper bound of input rates allowing reliable computation, i.e. decodability of noisy outputs into expected outputs. These results hold when the one-sided…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
