Algorithmic catalysts reduce irreversible computation for a task class, with speed-up bounded by substrate-descriptor mutual information and offset by Landauer erasure cost, yielding a minimum deployment horizon for energetic favorability.
IBM Journal of Research and Development32(1), 16–23 (1988)
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
Algorithmic catalysts reduce irreversible computation for a task class, with speed-up bounded by substrate-descriptor mutual information and offset by Landauer erasure cost, yielding a minimum deployment horizon for energetic favorability.