What does this equation mean?

The complexity dimension separates simulation sharply from the other two approaches. A simulation can, in principle, be run at essentially any scale the available compute allows: more grid points, finer time steps, more Monte Carlo samples, larger ensembles. Cost trades directly and continuously against precision. Neither peer review nor formal proof has that kind of dial. A human referee cannot review “80% as carefully” and get an 80%-as-reliable answer in linear proportion; below some threshold of attention, review quality can fail outright rather than gracefully degrading. A formal proof either typechecks or it does not — there is no partial credit inside the kernel, only degrees of how much of a theory has been formalized so far. This is why an enormous, well-funded push to formalize the entirety of some field of mathematics is a fundamentally different kind of project than “run the simulation twice as long.” $\hat{f}(x) = f(x) + \varepsilon_{\text{disc}}(h) + \varepsilon_{\text{round}}(u) + \varepsilon_{\text{model}}$. This decomposition is worth writing out because it names what a reported simulation number actually is: not the true answer f(x) , but a sum of the true answer with a discretization error that shrinks with step size h , a rounding error governed by machine precision u , and — the term simulations share with no other approach on this list — an irreducible modeling error from every simplifying assumption baked into the equations themselves before any computer touches them. A formal proof and a peer-reviewed argument both aim at f(x) exactly; a simulation reports $\hat{f}(x)$ and, if it is honest, reports an estimate of how large the three error terms might be.