16 citations · 24 across the 5 of their papers we have counts for
5 papers
Turing machines deciders, part I
The bbchallenge Collaboration, Justin Blanchard, Konrad Deka +9
The Busy Beaver Challenge (or bbchallenge) aims at collaboratively solving the following conjecture: "" [Radó, 1962], [Marxen and Buntrock, 1990], [Aaronson,…
Differentially Private Generation of Small Images
Justus T. C. Schwabedal, Pascal Michel, Mario S. Riontino
We explore the training of generative adversarial networks with differential privacy to anonymize image data sets. On MNIST, we numerically measure the privacy-utility trade-off us…
Simulation of the Collatz 3x+1 function by Turing machines
Pascal Michel
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…
Problems in number theory from busy beaver competition
Pascal Michel
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 t…
The Busy Beaver Competition: a historical survey
Pascal Michel
Tibor Rado defined the Busy Beaver Competition in 1962. He used Turing machines to give explicit definitions for some functions that are not computable and grow faster than any com…