Simulation of the Collatz 3x+1 function by Turing machines
Logic
2014-09-26 v1
Abstract
We give new Turing machines that simulate the iteration of the Collatz 3x+1 function. First, a never halting Turing machine with 3 states and 4 symbols, improving the known 3x5 and 4x4 Turing machines. Second, Turing machines that halt on the final loop, in the classes 3x10, 4x6, 5x4, and 13x2.
Cite
@article{arxiv.1409.7322,
title = {Simulation of the Collatz 3x+1 function by Turing machines},
author = {Pascal Michel},
journal= {arXiv preprint arXiv:1409.7322},
year = {2014}
}
Comments
8 pages