A thermodynamically consistent model of finite state machines
arXiv:1806.04875
Abstract
Finite state machines (FSMs) are a theoretically and practically important model of computation. We propose a general, thermodynamically consistent model of FSMs and characterise the resource requirements of these machines. We model FSMs as time-inhomogeneous Markov chains. The computation is driven by instantaneous manipulations of the energy levels of the states. We calculate the entropy production of the machine, its error probability, and the time required to complete one update step. We find that a sequence of generalised bit-setting operations is sufficient to implement any FSM.
References in corpus (7)
- Thermodynamic uncertainty relation for biomolecular processes
- Optimal finite-time erasure of a classical bit
- Finite-time erasing of information stored in fermionic bits
- Fundamental costs in the production and destruction of persistent polymer copies
- Thermodynamics of stochastic Turing machines
- Extending Landauer's Bound from Bit Erasure to Arbitrary Computation
- The thermodynamics of quasi-deterministic digital computers