124 search results - page 20 / 25 » The Undecidability of the Generalized Collatz Problem |
123
Voted
FSTTCS
2005
Springer
15 years 9 months ago
2005
Springer
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
137
Voted
PODS
1997
ACM
15 years 7 months ago
1997
ACM
We consider the problem of answering datalog queries using materialized views. The ability to answer queries using views is crucial in the context of information integration. Prev...
121
Voted
CONCUR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on tr...
127
Voted
ACTA
2010
15 years 3 months ago
2010
This paper describes an effective verification procedure for imperative programs that handle (balanced) tree-like data structures. Since the verification problem considered is unde...
124
Voted
ECCC
2006
15 years 3 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...