Recombinations of Busy Beaver Machines

Details Recombinations of Busy Beaver Machines Recombinations of Busy Beaver Machines

2009-08-27

arxiv.org/abs/0908.4013v3

Computer Science

Computational Complexity

15 pages, 11 figures; added new recombinated M_PP(4097) machines

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Recombinations of Busy Beaver Machines does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Recombinations of Busy Beaver Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Recombinations of Busy Beaver Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-411717