← All parts of this equation

Equation 13 · Part 3 · The Economics of Codex: Tokens, Sandboxes, Review Time, and Software Throughput

Symbol m

m∗(x)=arg⁡max⁡m[pm(x)V(x)−Cm(x)−Hm(x)−Rm(x)],m^*(x)=\arg\max_m \left[p_m(x)V(x)-C_m(x)-H_m(x)-R_m(x)\right],
mm

What this part means

m is part of the quantity the equation computes from the expression on the right.

Its job in the formula

m is part of the quantity the equation computes from the expression on the right.

The passage around this formula

For task features x , choose model and reasoning configuration m to maximize m∗(x)=arg⁡max⁡m[pm(x)V(x)−Cm(x)−Hm(x)−Rm(x)]m^*(x)=\arg\max_m \left[p_m(x)V(x)-C_m(x)-H_m(x)-R_m(x)\right]. where HmH_m is human supervision and RmR_m expected residual risk. The cheapest model can cost more if it creates repeated attempts or review. The strongest model can be wasteful on deterministic extraction.

Read this part in the article →

Learn the underlying idea

A function assigns an output to each allowed input. The expression f(x) means “apply f to x”.

Open the illustrated functions: inputs become outputs guide →

See this notation across published equations →

Sources cited in the article section

These citations provide research context; check each source for the exact claim it supports.