The Busy Beaver question asks how long a Turing machine program of a fixed length can run before halting (or more generally, reaching some particular condition). The question was first posed in 1962. It didn’t take long for researchers to realize that solving this question for any non-trivial case would require the use of computers. Sometimes they named the specific hardware they used. This post is a list of all the computers I have seen mentioned in the literature.
