next up previous contents index
Next: #siegelmann91j### Up: Turing machines Previous: Linearly-bounded automata   Contents   Index


Turing computability with DTRNN

Discrete-time recurrent neural networks may be shown to be capable of performing the same computation as any Turing machine by showing that a DTRNN may simulate the universal Turing Machine. This is the subject of one of the papers featured in this section:



Subsections

Debian User 2002-01-21