12/17/2022, 01:37 PM
There is alot to unpack here but this already projects some light on my fragile understanding of your old attempt of turning Bennet into Goodstein.
If possible, it would be interesting to see if Gottfried/Sheldon can somehow manage to extract some efficient truncated matrix black magic out of this... so to have some run-able pariGP.
Also, I wonder if using the Limit trick for hyperoperations would produce easier finite order truncations matrices... then we could just have something that evaluates in human amount of time and just leave formal convergence proof for another day, just like Sheldon and Gottfried codes.
In fact.... I don't think a pc would take too much to work with 5 or 6 order square matrices... or maybe it does?
If possible, it would be interesting to see if Gottfried/Sheldon can somehow manage to extract some efficient truncated matrix black magic out of this... so to have some run-able pariGP.
Also, I wonder if using the Limit trick for hyperoperations would produce easier finite order truncations matrices... then we could just have something that evaluates in human amount of time and just leave formal convergence proof for another day, just like Sheldon and Gottfried codes.
In fact.... I don't think a pc would take too much to work with 5 or 6 order square matrices... or maybe it does?
Mother Law \(\sigma^+\circ 0=\sigma \circ \sigma^+ \)
\({\rm Grp}_{\rm pt} ({\rm RK}J,G)\cong \mathbb N{\rm Set}_{\rm pt} (J, \Sigma^G)\)
