Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

TAMC
2007
Springer

favoriteEmaildiscussreport

146views Applied Computing» more TAMC 2007»

The Undecidability of the Generalized Collatz Problem

13 years 11 months ago

The Undecidability of the Generalized Collatz Problem

Download people.cs.uchicago.edu

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 show that a natural generalization of the Collatz problem is recursively undecidable.

Stuart A. Kurtz, Janos Simon

Real-time Traffic

Collatz Problem | Iterative Process Halts | Recursively Undecidable | TAMC 2007 |

claim paper

Related Content

» Some results on the Collatz problem

» Inclusion Problems for Patterns with a Bounded Number of Variables

» Binary generalized Post Correspondence Problem

» Decidability and Undecidability Results for Propositional Schemata

» Graph Logics with Rational Relations and the Generalized Intersection Problem

» Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs

» The Ricean Objection An Analogue of Rices Theorem for Firstorder Theories

» Improving Techniques for Proving Undecidability of Checking Cryptographic Protocols

» About the domino problem in the hyperbolic plane a new solution

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	TAMC
Authors	Stuart A. Kurtz, Janos Simon

Comments (0)