Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This paper establishes a thermodynamic theory for algorithmic catalysis, proving that speed-ups are fundamentally limited by algorithmic mutual information and the energy cost of Landauer erasure. By deriving a coupling theorem that lower-bounds the deployment horizon for such catalysts, the work provides a rigorous information-theoretic constraint on the energetic feasibility of reusable computational structures. These findings offer a theoretical ceiling for efficiency gains in learned systems, moving beyond empirical benchmarks to address the fundamental physics of intelligent computation.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Watts-per-Intelligence Part II: Algorithmic Catalysis

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2604.20897v2 Announce Type: replace-cross Abstract: We develop a thermodynamic theory of algorithmic catalysis within the watts per intelligence framework, identifying reusable computational structures that reduce irreversible operations for a task class while satisfying bounded restoration and structural selectivity constraints. We prove that any class specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that encoding this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment horizon required for an algorithmic catalyst to be energetically favourable. The framework is illustrated on an affine SAT class and situates contemporary learned systems within an information thermodynamic constraint on intelligent computation.

Abstract:We develop a thermodynamic theory of algorithmic catalysis within the watts per intelligence framework, identifying reusable computational structures that reduce irreversible operations for a task class while satisfying bounded restoration and structural selectivity constraints. We prove that any class specific speed-up is upper-bounded by the algorithmic mutual information between the substrate and the class descriptor, and that encoding this information incurs a minimum thermodynamic cost via Landauer erasure. Combining these results yields a coupling theorem that lower-bounds the deployment horizon required for an algorithmic catalyst to be energetically favourable. The framework is illustrated on an affine SAT class and situates contemporary learned systems within an information thermodynamic constraint on intelligent computation.

Information Theory (cs.IT); Artificial Intelligence (cs.AI); Computational Physics (physics.comp-ph)

arXiv:2604.20897 [cs.IT]

(or arXiv:2604.20897v2 [cs.IT] for this version)

https://doi.org/10.48550/arXiv.2604.20897 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 209 cuvinte

Subiecte conexe