Thermodynamics of deterministic finite automata operating locally and periodically
@inproceedings{Ouldridge2022ThermodynamicsOD, title={Thermodynamics of deterministic finite automata operating locally and periodically}, author={Thomas E. Ouldridge and David H. Wolpert}, year={2022} }
Physical computational devices have operational constraints that necessitate nonzero entropy production (EP). In particular, almost all real-world computers are “periodic” in that they iteratively apply the same physical process, and are “local” in that not all physical variables that are statistically coupled are also physically coupled. Here we investigate the nonzero EP that necessarily results from these constraints in deterministic finite automata (DFA), a foundational system of computer…
One Citation
Inclusive Thermodynamics of Computational Machines
- Computer Science
- 2022
The Myhill-Nerode theorem of computer science is used to prove that out of all DFAs which recognize the same language, the “minimal complexity DFA” is the one with minimal EP for all dynamics and at all iterations.
References
SHOWING 1-3 OF 3 REFERENCES