124 search results - page 5 / 25 » The Undecidability of the Generalized Collatz Problem |
FOSSACS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We extend discrete-timed Petri nets with a cost model that assigns token storage costs to places and firing costs to transitions, and study the minimal cost reachability...
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
ECAI
2010
Springer
15 years 27 days ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
ENTCS
2008
14 years 12 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
CG
2002
Springer
14 years 11 months ago
2002
Springer
Abstract. Post's correspondence problem (PCP) is a classic undecidable problem. Its theoretical unbounded search space makes it hard to judge whether a PCP instance has a solu...