Description Complexity Bounds for Analytic Approximations of Lipschitz Functions
We study how many bits are needed to write down an elementary analytic expression that uniformly approximates a Lipschitz function. Expressions are finite trees over the basis $\{+,-,\times,\div,\exp\}$ with the variables and rational constants, and their size is $\dc(f)$, the length of the shortest description of $f$...
Artem Vozmishchev
· 0 citations