Timeline for Can we ever achieve hypercomputation using recurrent neural networks?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 3, 2016 at 17:25 | comment | added | Doxosophoi | Yeah, I'm not saying they're they same thing. But it is the set of irrationals, within real numbers, not rationals, that suggest some hyper Turing possibility. | |
| Sep 3, 2016 at 17:21 | comment | added | Doxosophoi | I just read those two referenced pages. I see no argument that a neural net with just rational weights is hyper Turing. | |
| Sep 3, 2016 at 17:15 | comment | added | Doxosophoi | Something must have got lost in translation. This is from a paper on alanturing.net: In the special case where all the interconnection weights are rational, each such network is equivalent to a Turing machine (Siegelmann and Sontag 1992). If the connection matrix contains at least one irrational weight, the processor network can compute non Turing-machine-computable functions, even in polynomial time. p29, BEYOND THE UNIVERSAL TURING MACHINE | |
| Sep 3, 2016 at 16:34 | comment | added | Doxosophoi | Do you have a link? Not behind a paywall? | |
| Sep 3, 2016 at 1:47 | history | answered | Doxosophoi | CC BY-SA 3.0 |