Michel, Pascal - Problems in number theory from busy beaver competition

lmcs:1611 - Logical Methods in Computer Science, December 14, 2015, Volume 11, Issue 4
Problems in number theory from busy beaver competition

Authors: Michel, Pascal

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 challenges. This article takes up the following one: How can a small Turing machine manage to produce very big numbers? It provides the following answer: mostly by simulating Collatz-like functions, that are generalizations of the famous 3x+1 function. These functions, like the 3x+1 function, lead to new unsolved problems in number theory.


Source : oai:arXiv.org:1311.1029
DOI : 10.2168/LMCS-11(4:10)2015
Volume: Volume 11, Issue 4
Published on: December 14, 2015
Submitted on: March 11, 2015
Keywords: Mathematics - Logic,Computer Science - Computational Complexity,Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 104 times.
This article's PDF has been downloaded 118 times.