User blog comment:QuasarBooster/Everlasting Egrets/@comment-33713741-20190720113923/@comment-39253344-20190803212349

I hit a road bump. There either exists a Turing machine that can simulate any FGH expression with any countable ordinal(s) (in which case an uncomputable function would surpass my function) or there isn't (in which case I can't create my function)