Equilibrium and Termination
Logic in Computer Science
2010-06-09 v1
Abstract
We present a reduction of the termination problem for a Turing machine (in the simplified form of the Post correspondence problem) to the problem of determining whether a continuous-time Markov chain presented as a set of Kappa graph-rewriting rules has an equilibrium. It follows that the problem of whether a computable CTMC is dissipative (ie does not have an equilibrium) is undecidable.
Cite
@article{arxiv.1006.1430,
title = {Equilibrium and Termination},
author = {Vincent Danos and Nicolas Oury},
journal= {arXiv preprint arXiv:1006.1430},
year = {2010}
}