Turing computability with neural nets
- 1 January 1991
- journal article
- Published by Elsevier in Applied Mathematics Letters
- Vol. 4 (6), 77-80
- https://doi.org/10.1016/0893-9659(91)90080-f
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On the computational power of sigmoid versus Boolean threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991
- Dynamics of iterated-map neural networksPhysical Review A, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989