Two Cellular Automata for the 3x+1 Map
M. Bruschi
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.
Create a lesson
Related papers
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian
Diagonal Periods and Newton Supports of Rules 30, 86 and 135
Tigran Nersissian
Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre
James Edmond
Optical free space extreme learning machine for the implementation of emergent complex systems
Elena Moreno, Fernando Soldevila, Daniel Torrent