User blog comment:Deedlit11/Extending the fast-growing hierarchy to nonrecursive ordinals/@comment-5150073-20130414231904/@comment-5529393-20130416143920

Well, first you would have to pick a specification for oracle Turing machines. Once you do that, programming BB(n) is not that hard, at least in principle. You program an oracle Turing machine to simulate all Turing machines with no more than n states, (running only the ones that halt of course) and keep track of the one that produces the most 1's. In practice, it might be nontrivial to write an OTM that simulates all TMs up to n states.