Statements like "X is can be used to represent any program/function, therefore it is all we are every going to need" are pretty silly.
-
-
Second, it is not relevant whether a program *can be represented* (that's almost always true), one care whether a program *can be developed* (not just in theory, but in practice) using a particular approach.
Show this thread -
So statements like "NNs are universal approximators (or, 'there are Turing-complete RNN architectures'), therefore DL has no limits" is like saying "you can use a pen & some paper to produce the complete works of Shakespeare". Technically true, but pretty silly at the same time.
Show this thread
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.