News for hackers. Stuff that matters.

xjparker

Hi, I'm the journalist who wrote the Quanta article. Scott Aaronson's Busy Beaver survey paper provides a function for calculating the total number of possible (2-symbol) Turing machines with n states: T(n)=(4n + 1)^2n. When n=2, T(n)=6,561. According to an email I got from Aaronson, this "allow[s] the possibility of halt states."