Reusable algorithmic structures (catalysts) for task classes yield speed-ups upper-bounded by mutual information, with minimum thermodynamic installation costs via Landauer erasure and a lower bound on favorable deployment time.
Information and Control61(1), 15–37 (1984)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Watts-per-Intelligence Part II: Algorithmic Catalysis
Reusable algorithmic structures (catalysts) for task classes yield speed-ups upper-bounded by mutual information, with minimum thermodynamic installation costs via Landauer erasure and a lower bound on favorable deployment time.