The New Computational Power of Neural Networks (original) (raw)
Neural Network World, 1996
Abstract
Recent results changed essentially our view concerning the generality of neural networks' models. Presently, we know that such models i) are more powerful than Turing machines, ii) are universal approximators, iii) can represent any logical function, iv) can solve efficiently ...
Razvan Andonie hasn't uploaded this paper.
Let Razvan know you want this paper to be uploaded.
Ask for this paper to be uploaded.