News

However, if you pick a number for n, such as TREE(3) or TREE(4), it is theoretically possible to solve the proof with finite arithmetic and demonstrate that TREE(3) is not infinite—you just ...