107

This number is a prime.

Single Curio View:   (Seek other curios for this number)
Allan Brady proved in 1983 that the maximal number of steps that a four-state Turing machine can make on an initially blank tape before eventually halting is 107.

Submitted: 2002-01-05 11:39:48;   Last Modified: 2009-01-16 21:42:50.
Printed from the PrimePages <primes.utm.edu> © G. L. Honaker and Chris K. Caldwell