A thermodynamically consistent model of finite state machines Article Swipe
Related Concepts
Computation
Finite-state machine
Finite state
Computer science
Entropy (arrow of time)
Sequence (biology)
Algorithm
Markov chain
State (computer science)
Entropy production
Hidden Markov model
Markov process
Theoretical computer science
Mathematics
Statistical physics
Artificial intelligence
Physics
Machine learning
Genetics
Biology
Statistics
Quantum mechanics
Dominique Chu
,
Richard E. Spinney
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1806.04875
· OA: W2951090851
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.1806.04875
· OA: W2951090851
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.
Related Topics
Finding more related topics…