Green machines In 1964 Milton Green developed a lower bound for the 1s-counting variant of the Busy Beaver function that was published in the proceedings of the 1964 IEEE symposium on switching circuit theory and logical design. Heiner Marxen and Jürgen Buntrock described it as "a non-trivial (not primitive recursive) lower bound". Free HTML version by author This lower bound can be calculated but is too complex to state as a single expression in terms of n. This was done with a set of Turing machines, each of which demonstrated the lower bound for a certain n. When n=8 the method gives .
green machines in 1964 milton green developed a lower bound for the 1s-counting variant of the busy beaver function that was published in the proceedings of the 1964 ieee symposium on switching circuit theory and logical design heiner marxen and jürgen buntrock described it as "a non-trivial (not primitive recursive) lower bound" free html version by author this lower bound can be calculated but is too complex to state as a single expression in terms of n this was done with a set of turing machines each of which demonstrated the lower bound for a certain n when n=8 the method gives 