This may be a bit off topic, but I've always wondered, is there a current record for sequence of trees that have been computed for TREE(3) (that is, sequence of trees that accord to the rules of TREE(3))? Given the obscene size we know to be possible for such a sequence - TREE(3) - has anyone actually found/computed a sequence of length 100? 1000? 1 billion? Does adding trees become difficult, computationally, given the need to check each new nth tree against the n-1 predecessors for embedded trees?
I would also add an additional ten classes starting with you basic functions such as counting and addition and then into tranfinite functions such as those covered under Omega+ and omega× then so on and then tran finite function under entirely different ordinal from function and Omega into epsilon and eta..... Leading all the way up to non computed function hierarchy (if such a thing truly exist)
This may be a bit off topic, but I've always wondered, is there a current record for sequence of trees that have been computed for TREE(3) (that is, sequence of trees that accord to the rules of TREE(3))? Given the obscene size we know to be possible for such a sequence - TREE(3) - has anyone actually found/computed a sequence of length 100? 1000? 1 billion? Does adding trees become difficult, computationally, given the need to check each new nth tree against the n-1 predecessors for embedded trees?
I don't know the record. But 100 seem quite possible. The probably use some other symbols to simplify the trees ad with computers of course.
Nice video
Thx for the good video
nice
Rayo functions extensions utilizing infinities is ill defined, like omega order set theory OOST(n)? and restricted form of Rayo(infinite n)?
I would also add an additional ten classes starting with you basic functions such as counting and addition and then into tranfinite functions such as those covered under Omega+ and omega× then so on and then tran finite function under entirely different ordinal from function and Omega into epsilon and eta..... Leading all the way up to non computed function hierarchy (if such a thing truly exist)
The point of this video is to make a beginner's guide to big number classes and the purpose is to make it in 10 classes or fewer.
3:07 isnt G1 4 arrows?
Yes. I was just saying both of them are class 4.
@@carbrickscity oh i misinterpreted that
Wheres a new video
Me first yay
Pin me pls