Talk:Church-Kleene ordinal

It's pretty unclear for me how to go through all recursive ordinals with this \(O(n)\). For example, why we pick expression 3*5^10? Why not 4*5^10 or 65*7^63? Also, is O(2^^10)<O(2^2^(3*5^10))? Seems unlogical, as 2^^10 is certainly larger than 2^2^(3*5^10). We really need to clarify it, because there can be readers who unprepared to these complexities. Ikosarakt1 (talk ^ contribs) 18:17, July 9, 2013 (UTC)