3 ms·
Computation cannot be reduce to a mere function. A NN is not a Turing device.
by slashdave 2y ago
Computation cannot be reduce to a mere function. A NN is not a Turing device.
- Kuinox 2y agoA single invocation of an NN isn't turing complete, but as soon as you loop it, it is. https://en.wikipedia.org/wiki/Universal_approximation_theorem https://en.wikipedia.org/wiki/Universal_approximation_theore...
- slashdave 2y agoYeah, exactly. A network of NN functions is a model for AGI. My point is that to say that a NN can approximate a mathematical function is correct. But to now equate such a function to a generalized procedure (like a simulation of a brain) is a mistake.
- Kuinox 2y ago> But to now equate such a function to a generalized procedure You never said that. Are you saying only a brain can understand?