Infrastructure · Primitives
ComputationalEntropyRate
Bits submitted per bit accepted in a channel that computes, where rejection is meaningful work rather than noise
Definition
Mechanism
Treat a channel as computational: it accepts or rejects inputs according to a language (a password validator, an environment selecting viable genomes, a colleague judging an idea). The computational entropy rate is the number of bits that must be submitted for each bit accepted; if 66% of submitted length is accepted, the rate is about 1.5. It looks like the friction of ChannelCapacity, but the cause is different: low Shannon capacity reflects meaningless noise, while a high computational entropy rate reflects meaningful rejection, i.e. the channel doing more work. The rate measures the difference in information between two languages, the generator's and the acceptor's. A further ratio, the computational channel flow ratio, compares the average length of accepted inputs with rejected ones: a channel that rejects short inputs early and accepts long ones can consider more options at the same entropy rate, as a writer who bins bad pages early can afford to be more critical.
Invariants
- The rate is at least 1; it equals 1 only when every submitted input is accepted
- Rejection reflects the acceptor's criteria, not corruption in transit
- At the same entropy rate, channels with different flow ratios differ in how efficiently they consider options
Risks
Failure modes
Reading all friction as inefficiency to be removed, so the options it encodes are lost
Lowering the rate by accepting everything, which removes the channel's useful criteria (e.g. password strength)
Confusing it with noise-limited ChannelCapacity
Relationships
Builds on
References
The maximum rate at which information can be reliably transmitted through a channel, given its noise
Used by
References
Mind
Switch one line of development back and forth between two inversely related niches, so that a path to complex function exists where no path exists within a single niche
Mind
The internal load a system carries from being partly prepared for possible external stressors
Mind
An implementation that is at once one working model and a partial implementation of several others, so that some functions can be completed or removed with a small change
Mind
Inputs that are generated but currently rejected are cheap, latent options sitting in the gap between the generator's and the acceptor's languages
