Page "Busy beaver" Paragraph 2
from
Wikipedia
The n-state busy beaver game ( or BB-n game ), introduced in Tibor Radó's 1962 paper, involves a class of Turing machines, each member of which is required to meet the following design specifications:
Page 1 of 1.
1.951 seconds.