tlooto
Sign up
MathematicsComputer Science

Turing computability with neural nets

H. Siegelmann, Eduardo Sontag

1991Applied Mathematics Letters

DOI: 10.1016/0893-9659(91)90080-f

tlooto Summary

The existence of a finite neural network, made up of sigmoidal neurons, which simulates a universal Turing machine, composed of less than 10 5 synchronously evolving processors, interconnected linearly is shown.

Abstract

Abstract is not available.

Citation format

SIEGELMANN, H.; SONTAG, Eduardo. Turing computability with neural nets. Applied Mathematics Letters, 1991, 4: 77–80.