User blog comment:Vel!/FGH Gripe/@comment-5982810-20150325004329/@comment-24.103.234.74-20150325235942

(2) If framed as conjectures, they're ill-formed. They can't even be verified or refuted because the comparability relation and the FS systems are not defined. They're not even conjectures.

They are stated informally but they can be formalized pretty easily, and it is not that difficult to assertain what is trying to be claimed. Basically the claim is that a certain function of FGH, f_a(n) is the first member of the hierarchy to outgrow the given function or system. A definition for growth rate is easily enough provided by professional mathematics, and I have on several occasions proposed the use of the definition:

f(n) [<] g(n) iff Ak Em | f(n+k) < g(n) : n>m

If you feel the language is to vague, then use more formal language to say the same thing. Instead of saying "tetrational arrays are comparable to f_e0(n) in FGH", say that all tetrational arrays are eventually dominated by f_e0(n), and you will be saying EXACTLY what was meant in the first place!