Re:The truth about deep learning
by riyadparvez on Wednesday June 01, 2016 @10:55PM
(#11820057)
There is a new research going on in Neural Turing Machine which, in theory, can exactly do that. Maybe we have to wait some time to see NNs can sort numbers.
On a high level, sort() is a seq2seq function, I think throw LSTM/RNN will yield some interesting results to this problem.
Sibling comments have mentioned Neural Turing Machines, but even just regular recurrent neural networks are technically Turing complete[1].
A Neural Turing Machine can learn programs.
ok i meant some function
Re:The truth about deep learning
by umanwizard on Wednesday June 01, 2016 @10:52PM
(#11820039)
sort is a function (in the mathematical sense)
then if it 's a continuous function it can be approximated
and if it's not a continuous function?
https://en.wikipedia.org/wiki/Universal_approximation_theore...
It's proved for a subset of functions. Maybe you can prove it for more.
Teach one to sort an arbitrary list. A universal function approximator is not a Turing machine.