Two undecidable variants of Collatz's problems

DOI10.1016/J.TCS.2008.08.029zbMath1153.03019OpenAlexW2052754090MaRDI QIDQ955043

Eero Lehtonen

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.08.029

zbMATH Keywords

undecidabilityCollatz's conjectureCollatz's original problem

Mathematics Subject Classification ID

Decidability (number-theoretic aspects) (11U05) Undecidability and degrees of sets of sentences (03D35)

Related Items (3)

Entire functions with undecidable arithmetic properties ⋮ Stack and register complexity of radix conversions ⋮ An Undecidable Permutation of the Natural Numbers

Cites Work

• Unnamed Item
• Unnamed Item
• The 3x + 1 Problem and Its Generalizations

This page was built for publication: Two undecidable variants of Collatz's problems