The numerical algorithms, to me, specifically look like optimized simulations to get to the answer, which to me speaks some form of computational irreducibility.
Golly, the cellular automata program, is also heavily optimized and parallelized, however this does not mean the particular cellular algorithms are computationally reducible.
What do you think? Thanks for your answer.
