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

How to use oracle Turing machine? Is it so hard to write algorithm for OTM that computes BB(n) or BB^n(n)?