|
|
|
|
|
|
by IshKebab
970 days ago
|
|
|
> a Universal approximator Yes that's exactly my point. A lookup table is a universal approximator. Good luck making AI with LUTs. It's kind of like the halting problem or the no-free-lunch theorem. Interesting academic properties but they don't really have any practical significance and often confuse people into thinking that things like formal verification and lossless compression are impossible. |
|
|