User blog comment:Nnn6nnn/Where Will Googology Go?/@comment-25337554-20180213032340/@comment-32876686-20180214014306

Actually, while no function calculable in this program can exceed \(\Sigma(n)\), such a program would be able to define oracle Turing machines which far rival in power the program, the same way that the human mind can define oracle Turing machines that produce large numbers despite the fact the computational power of our minds is limited by oracle Turing machines.