zlacker

[parent] [thread] 1 comments
1. sudden+(OP)[view] [source] 2025-07-07 08:31:37
>There's a rich family of universal approximation theorems

Wow, look-up tables can get increasingly good at approximating a function!

replies(1): >>ants_e+lv
2. ants_e+lv[view] [source] 2025-07-07 13:00:57
>>sudden+(OP)
A function is by definition a lookup table.

The lookup table is just (x, f(x)).

So, yes, trivially if you could construct the lookup table for f then you'd approximate f. But to construct it you have to know f. And to approximate it you need to know f at a dense set of points.

[go to top]