Equilibrium and Termination
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 continuoustime Markov chain presented as a set of Kappa graphrewriting rules has an equilibrium. It follows that the problem of whether a computable CTMC is dissipative (ie does not have an equilibrium) is undecidable.
 Publication:

arXiv eprints
 Pub Date:
 June 2010
 arXiv:
 arXiv:1006.1430
 Bibcode:
 2010arXiv1006.1430D
 Keywords:

 Computer Science  Logic in Computer Science
 EPrint:
 EPTCS 26, 2010, pp. 7584