Hacker News new | past | comments | ask | show | jobs | submit login

There is also "Turing Computability With Neural Nets" (Seigelmann, Sontag, 1991 http://www.sciencedirect.com/science/article/pii/08939659919...)

    This paper shows the existence of a finite neural network, made up of sigmoidal 
    neurons, which simulates a universal Turing machine. It is composed of less than
    10^5 synchronously evolving processors, interconnected linearly. High-order
    connections are not required.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: