Recombinations of Busy Beaver Machines
Computational Complexity
2009-09-07 v3
Abstract
Many programmers belive that Turing-based machines cannot think. We also believe in this, however it is interesting to note that the most sophisticated machines are not programmed by human beings. We have only discovered them. In this paper, using well-known Busy Beaver and Placid Platypus machines, we generate further very similar, but not exactly the same machines. We have found a recombinated BB_5 machine which can make 70.740.809 steps before halting.
Cite
@article{arxiv.0908.4013,
title = {Recombinations of Busy Beaver Machines},
author = {Norbert Bátfai},
journal= {arXiv preprint arXiv:0908.4013},
year = {2009}
}
Comments
15 pages, 11 figures; added new recombinated M_PP(4097) machines