• Corpus ID: 251564609

Thermodynamics of deterministic finite automata operating locally and periodically

  title={Thermodynamics of deterministic finite automata operating locally and periodically},
  author={Thomas E. Ouldridge and David H. Wolpert},
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… 

Figures from this paper

Inclusive Thermodynamics of Computational Machines

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.



A variant of this modularity mismatch cost for DFA was derived in Ref. [34], for DFA operating in steady state

    EP is positive if the sequences (Λi−2,Λi−1, Λi) = (a or b, b, a) and (Λi−2,Λi−1, Λi) = (b, a, a) both have non-zero probability

      This observation was made for σ mod alone in Ref