Here's a quick write up, which implicitly creates the construction. It's pretty rough around the edges. We don't need the \(\beta\) method as much as I thought; but how I've coded small solutions used it--I think haphazardly though. This is definitely an existence of holomorphic semi-operators though. I just need to read more about PDEs and create a better construction method... Scratching my head
When_Bennet_becomes_Goodstein.pdf (Size: 277.81 KB / Downloads: 600)
I'm currently trying to program in a method, but it requires an efficient protocol for \(\exp_b^{\circ s}(1)\), as we vary \(b\) and \(s\). So I can program in the solution. But it'd be like a week to make a single significant graph. Programming this is difficult because most protocols fix b upon initialization (Sheldon, myself, and Kouznetsov). I think I know how to do it, but it's tough.
When_Bennet_becomes_Goodstein.pdf (Size: 277.81 KB / Downloads: 600)
I'm currently trying to program in a method, but it requires an efficient protocol for \(\exp_b^{\circ s}(1)\), as we vary \(b\) and \(s\). So I can program in the solution. But it'd be like a week to make a single significant graph. Programming this is difficult because most protocols fix b upon initialization (Sheldon, myself, and Kouznetsov). I think I know how to do it, but it's tough.