• Corpus ID: 119687259

Simulation of the Collatz 3x+1 function by Turing machines

  title={Simulation of the Collatz 3x+1 function by Turing machines},
  author={Pascal Michel},
  journal={arXiv: Logic},
  • Pascal Michel
  • Published 24 September 2014
  • Materials Science
  • arXiv: Logic
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. 

Tables from this paper

Problems in number theory from busy beaver competition
  • Pascal Michel
  • Mathematics, Computer Science
    Log. Methods Comput. Sci.
  • 2015
By introducing the busy beaver competition of Turing machines, in 1962, Rado defined noncomputable functions on positive integers. The study of these functions and variants leads to many mathematical
Compiling Turing Machines into Storage Modification Machines
This work proposes a simple transformation of TM into SMM, setting the base for a straightforward TM-to-SMM compiler.
Yurii Rogozhin's Contributions to the Field of Small Universal Turing Machines
A brief note summarises this and a few of Yurii Rogozhin's other contributions to the field, including his work with Manfred Kudlek on small circular Post machines.
Introducing a Finite State Machine for processing Collatz Sequences
It is proved that the Finite State Machine’s word transformation is equivalent to the standard Collatz number transformation and the possibilities for use of this approach at solving similar problems are discussed.
On the hardness of knowing busy beaver values BB(15) and BB(5, 4)
This paper puts a finite, albeit large, bound on Erdős’ conjecture, by making it equivalent to the following finite statement: for all 8 < n ≤ min(BB(15),BB(5, 4)) there is at least one digit 2 in the base 3 representation of 2.
Collatz Sequences in the Light of Graph Theory
It is well known that the inverted Collatz sequence can be represented as a graph or a tree. Similarly, it is acknowledged that in order to prove the Collatz conjecture, one must demonstrate that


Busy beaver competition and Collatz-like problems
It is proved that the halting problem for Turing machines amounts to a well-known problem of number theory, that of the behavior of the repeated iteration of Collatz-like functions, that is functions defined by cases according to congruence classes.
The complexity of small universal Turing machines: A survey
Frontier between decidability and undecidability: a survey
Cellular automata about the 3x + 1 problem
  • in: Proc. LCCS’2001, Université Paris
  • 2001
3N+1, UTM e Tag-systems (Italian)
  • Dipartimento di Matematica dell’Università “La Sapienza” di Roma 98/38,
  • 1998
Cellular automata about the 3 x + 1 problem
  • The Ultimate Challenge : The 3 x + 1 Problem
Generalized 3 x + 1 functions and the theory of computation