The busy beaver "problem" is the question of, given a Turing Tape, what program can output the longest series of ones and still terminate.
See HaltingProblem, ChaitinsOmega