User blog comment:P進大好きbot/New Googological Ruler/@comment-31580368-20190718022500/@comment-31580368-20190718063317

About (non-serious) problems:

1) I understand that on a small scale the analysis will be very fuzzy. For theories that have fundamental sequences (FS) defined on their PTO can determine the following comparison: Limx→∞(Θ(t#n)/fPTO(t#n)+FS) < Limx→∞(Θ(t#n+1)/fPTO(t#n)+FS).

For larger scales, KP + LCO theories can be used. I know that my SLCON is still ill-defined, but I am working on it, and it seems to me, that it is possible to create a system of brief abrevieatur definitions of large calculating ordinals without using OCF. 2) Well #60 is already an extreme case, for starters, we can take a theory weaker.

3) I just wanted to ask this question. Some theories have the same PTO e.g.: etc.
 * 1) 12 PTO(PA) = PTO(ACA0) = PTo(KP-ω)
 * 2) 19 PTO(Δ12-CA+BI) = PTO(KPi)
 * 3) 30 PTO(П12-CA+BI) = PTO(KP+Σ1-sep)

But the numbers returned in the Turing halting function Θ(t) as I understand it will be different. Is there a way to compare which of these numbers will be greater?