Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Suppose you were given $N$ samples of $f$ (samples are irregularly placed and being drawn from a countable dense set $D$), If you can construct $F_N$ such that $\limsup\limits_{N\to\infty} \|f-F_N\|_{L^{\infty}(\Omega)} = \epsilon$ you have learnt the function. This is what I should have got into but I ended up with this!
both the number of samples and there by the arithmetic precision, both should go to infinity and only then we can expect $\lim\limits_{N\to \infty}\|f-F_N\|_{L^{\infty}(\Omega)} \to \epsilon$ or ofcourse it can better. but this is the best thing that can be said. I should probably use limit supremum.
Agree, the finite arithmetic precision to represent data points $x_i$ is problematic. Even if you have a large number of data points, it won't make up for it.
Just for illustration the solution function we got is $F(x) = x^2 + 5$. Then the computations required to compute the function $F$ is 1 multiplication and one addition. Just two computations and a couple of registers.
"Compute a function" is an algorithm or a formula that gives out $F(x)$ for a given $x$. And to do this, for a single given $x$, need to be done with finite registers, computations and ...blah blah blah...
See my question : "compute a function F : Given any query point x, one should give out F(x)"....only once...only for the given single $x$. Need not compute for all $x$ in the domain. Thats what I mean by compute a function.