124 search results - page 2 / 25 » The Undecidability of the Generalized Collatz Problem |
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
Abstract—We investigate some basic questions about the interaction of regular and rational relations on words. The primary motivation comes from the study of logics for querying ...
ENTCS
2008
13 years 6 months ago
2008
Consider the initial-value problem with computable parameters dx dt = p(t, x) x(t0) = x0, where p : Rn+1 Rn is a vector of polynomials and (t0, x0) Rn+1 . We show that the proble...
IGPL
2008
13 years 5 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
IEEEARES
2008
IEEE
14 years 21 days ago
2008
IEEE
Existing undecidability proofs of checking secrecy of cryptographic protocols have the limitations of not considering protocols common in literature, which are in the form of comm...
CORR
2007
Springer
13 years 6 months ago
2007
Springer
In this paper, we complete the construction of paper [9, 11]. Together with the proof contained in [9, 11], this paper definitely proves that the general problem of tiling the hy...