Two undecidable variants of Collatz's problems

DOI10.1016/J.TCS.2008.08.029zbMATH Open1153.03019OpenAlexW2052754090MaRDI QIDQ955043FDOQ955043

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

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

zbMATH Keywords

undecidabilityCollatz's conjectureCollatz's original problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The 3x + 1 Problem and Its Generalizations
• Title not available (Why is that?)

Cited In (5)

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

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)