User blog comment:Hyp cos/tree function and TREE(3)/@comment-5150073-20140624084600/@comment-25418284-20140624152532

In the general case, the problem of encoding recursive ordinals becomes undecidable; locally speaking, this means that at some point the algorithms for encoding/decoding will eventually require too much time and/or memory to implement. The reason for this is that our computers are computationally equivalent to linear bounded automata.

Did I do that right? I don't think I did that right.