Two undecidable variants of Collatz's problems

DOI10.1016/J.TCS.2008.08.029MaRDI QIDQ955043zbMATH OpenOpenAlexFDO

Authors 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

Collatz's conjectureCollatz's original problemundecidability

Mathematics Subject Classification ID

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

Recommendations

• The Undecidability of the Generalized Collatz Problem
• scientific article; zbMATH DE number 5885061
• Functional equations associated with congruential functions
• Some natural generalizations of the Collatz problem
• The ultimate challenge. The \(3x+1\) problem

Cites work

• scientific article; zbMATH DE number 3526785 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• The 3x + 1 Problem and Its Generalizations

Cited in

(6)

• Functional equations associated with congruential functions
• Iteration of functions and contractibility of acyclic 2-complexes
• Stack and register complexity of radix conversions
• Entire functions with undecidable arithmetic properties
• An Undecidable Permutation of the Natural Numbers
• The Undecidability of the Generalized Collatz Problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q955043)