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

I believe trees can reach any recursive ordinal, given enough complicated system of rules. The problem for TREE(n) is only in mysterious "homeomorphical embedding". How we can be sure that all trees between [] and ([]()) have this property?