Two undecidable variants of Collatz’s problems

The paper introduces a simple way to show that certain iterative, number theoretic problems are undecidable. As applications, variants of the Collatz’s conjecture and the so-called Collatz’s original problem are shown to be undecidable.