Equilibrium and Termination

Details Equilibrium and Termination Equilibrium and Termination

2010-06-08

arxiv.org/abs/1006.1430v1

EPTCS 26, 2010, pp. 75-84

Computer Science

Logic in Computer Science

Scientific paper

10.4204/EPTCS.26.7

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.

Affiliated with

Also associated with

No associations

Rating

Equilibrium and Termination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equilibrium and Termination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equilibrium and Termination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29475