124 search results - page 11 / 25 » The Undecidability of the Generalized Collatz Problem |
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The bounded synthesis problem is to construct an implementation that satisfies a given temporal specification and a given bound on the number of states. We present a so...
ICFEM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Verifying that a parameterized system satisfies certain desired properties amounts to verifying an infinite family of the system instances. This problem is undecidable ...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We consider Markov Decision Processes (MDPs) as transformers on probability distributions, where with respect to a scheduler that resolves nondeterminism, the MDP can be seen as ex...
FUIN
2006
13 years 7 months ago
2006
Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of univers...
CADE
2006
Springer
13 years 11 months ago
2006
Springer
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...