6 ms·

>Neural nets are universal function approximators. There isnt something they can't learn. Teach one to sort an arbitrary list. A universal function approximato

>Neural nets are universal function approximators. There isnt something they can't learn. Teach one to sort an arbitrary list. A universal function approximator is not a Turing machine.

deleted 10y ago
[deleted]
return0 10y ago
ok i meant some function
- umanwizard 10y ago
  sort is a function (in the mathematical sense)
  - return0 10y ago
    then if it 's a continuous function it can be approximated
    - harryjo 10y ago
      and if it's not a continuous function?
      - return0 10y ago
        https://en.wikipedia.org/wiki/Universal_approximation_theorem https://en.wikipedia.org/wiki/Universal_approximation_theore... It's proved for a subset of functions. Maybe you can prove it for more.
semisight 10y ago
A Neural Turing Machine can learn programs.
riyadparvez 10y ago
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.
- eva1984 10y ago
  On a high level, sort() is a seq2seq function, I think throw LSTM/RNN will yield some interesting results to this problem.
gradys 10y ago
Sibling comments have mentioned Neural Turing Machines, but even just regular recurrent neural networks are technically Turing complete[1]. [1] - http://lipas.uwasa.fi/stes/step96/step96/hyotyniemi1/ http://lipas.uwasa.fi/stes/step96/step96/hyotyniemi1/