124 search results - page 1 / 25 » The Undecidability of the Generalized Collatz Problem |
TAMC
2007
Springer
13 years 11 months ago
2007
Springer
The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and ...
ACTA
2000
13 years 5 months ago
2000
The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. T...
DLT
2010
13 years 7 months ago
2010
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...
TCS
2002
13 years 5 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
JAIR
2011
13 years 16 days ago
2011
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...