> Does it make sense to compare BB(n) against A333479(n)?
No, for proper comparison both should measure the argument size in bits.
That's why my top comment talks about the number of bits needed to encode an n-state TM in a straightforward manner.
So compare BB(n) with A333479(n*2*(2+ceil(log(n+1)))).
No, for proper comparison both should measure the argument size in bits. That's why my top comment talks about the number of bits needed to encode an n-state TM in a straightforward manner.
So compare BB(n) with A333479(n*2*(2+ceil(log(n+1)))).