Nuevo chat
Historial de búsqueda
Investigación académicaBúsqueda de artículosBibliotecaChats recientes
On the computational power of neural nets
On the computational power of neural nets
H. Siegelmann,Eduardo Sontag
1992 · DOI: 10.1145/130385.130432
Annual Conference Computational Learning Theory · 1,088 citas
TLDR
It is proved that one may simulate all Turing Machines by rational nets in linear time, and there is a net made up of about 1,000 processors which computes a universal partial-recursive function.
