User blog comment:Vel!/FGH Gripe/@comment-5150073-20150325034056

That's good. After all, the fastest-growing known functions in both computable and uncomputable fields of googology are based on strict formal systems.

I can suggest to write a program on real PL for each computable function to prove that it's really well-defined.