Approximates the probability of a 4-state Turing machine halting. So far approximated to be 0.3906 ± 0.0002. There are 20^8=2.56*10^10 4-state Turing machines. Perhaps obviously, a scratch project is unable to test that many Turing machines in a reasonable amount of time. This system instead chooses random Turing Machines to test. As a result, this can turn out numbers much faster but will never be 100% accurate.
me Extremely simple modifications can be made to adjust this to any n-state Turing machine for n less than or equal to 5 (above 5, the BB(n) is unknown, and therefore it is impossible to non-trivially tell if a Turing machine of more than 5 states will halt).
