Two Cellular Automata for the 3x+1 Map

Abstract

Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x+1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.

10 pages, 5 figures

Cited by in corpus (2)

• A generalization of the Collatz problem and conjecture
• Cellular Automata to More Efficiently Compute the Collatz Map