BUSY BEAVER
\bˈɪzi bˈiːvə], \bˈɪzi bˈiːvə], \b_ˈɪ_z_i b_ˈiː_v_ə]\
Sort: Oldest first
-
(BB) One of a series of sets of Turing Machineprograms. The BBs in the Nth set are programs of N statesthat produce a larger finite number of ones on an initiallyblank tape than any other program of N states. There is noprogram that, given input N, can deduce the productivity(number of ones output) of the BB of size N.The productivity of the BB of size 1 is 1. Some work has beendone to figure out productivities of bigger Busy Beavers - the7th is in the thousands.
By Denis Howe