News for hackers. Stuff that matters.
Re:Why traditional reinforcement learning will probably not ... by YeGoblynQueenne on Wednesday October 21, 2020 @06:14PM (#24852825)
Note that Turing complete means undecidable. An algorithm that can learn any program that can be computed by a Universal Turing Machine must, in the worst case, search an infinite program space. So, even if a Neural Turing Machine can learn arbitrary programs (I haven't read the paper so I can't say) it might need to consume infinite resources before learning any particular progarm.

In short- Turing completeness is no guaranteed path to AGI. Assuming an "AGI program" exists, it is hidden away in an infinity of almost identical, but not quite, programs.

There are no comments on this comment yet.