← Mathematical compendium

Published equation contexts

f^(x)=f(x)+εdisc(h)+εround(u)+εmodel\hat{f}(x) = f(x) + \varepsilon_{\text{disc}}(h) + \varepsilon_{\text{round}}(u) + \varepsilon_{\text{model}}

Why this formula appears here

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…

Read the full article-specific guide →

Read the representative guide

εdisc\varepsilon_{\text{disc}}

Symbol varepsilon_disc

varepsilondn_disc is one of the signed contributions combined to compute the quantity on the left.

Read this term in its guide →
εround\varepsilon_{\text{round}}

Symbol varepsilon_round

varepsilonrn_round is one of the signed contributions combined to compute the quantity on the left.

Read this term in its guide →
εmodel\varepsilon_{\text{model}}

Symbol varepsilon_model

varepsilonmn_model is one of the signed contributions combined to compute the quantity on the left.

Read this term in its guide →

How to interpret it

Read it with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

f^(x)=f(x)+εdisc(h)+εround(u)+εmodel\hat{f}(x) = f(x) + \varepsilon_{\text{disc}}(h) + \varepsilon_{\text{round}}(u) + \varepsilon_{\text{model}}

Equation 1 · Mathematics

Comparing the Main Approaches to Mathematics, Proof, and Scientific Computation

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions.

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…

Meanings in this article

  • uu: the rounding error governed by machine precision.
Equation guide → · Article →