The Undecidability of the Generalized Collatz Problem

DOI10.1007/978-3-540-72504-6_49zbMath1198.03043OpenAlexW1489267569WikidataQ56069526 ScholiaQ56069526MaRDI QIDQ5425466

Janos Simon, Stuart A. Kurtz

Publication date: 13 November 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72504-6_49

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Special sequences and polynomials (11B83)

Related Items (8)

THE 3x+1 PROBLEM VIEWED FROM ANOTHER SIDE ⋮ What else is undecidable about loops? ⋮ First-order concatenation theory with bounded quantifiers ⋮ Iteration of functions and contractibility of acyclic 2-complexes ⋮ The word problem for one-relation monoids: a survey ⋮ An automated approach to the Collatz conjecture ⋮ Complexity of Fractran and Productivity ⋮ Undecidable arithmetic properties of solutions of Fredholm integral equations

This page was built for publication: The Undecidability of the Generalized Collatz Problem