The Psychological Limits of Neural Computation
作者： Mirek Kárný , Kevin Warwick , Vera Kůrková
DOI: 10.1007/978-1-4471-1523-6_17
关键词: Computability 、 Recursively enumerable language 、 Halting problem 、 Computer science 、 Context (language use) 、 Algebra 、 Undecidable problem 、 Computable function 、 Turing machine 、 Turing
摘要: It is known that each algorithm Turing solvable. In the context of function computability, Church-Turing thesis states intuitively computable computable. The languages accepted by machines form recursively enumerable language family L 0 and, according to thesis, also class algorithmic sets. spite its generality, model can not solve any problem. Recall, for example, halting problem unsolvable: it undecidable if an arbitrary machine will eventually halt when given some specified, but arbitrary, input.
springer.com
sci-hub.st 参考文章(31)
Ian Parberry, None, Circuit complexity and neural networks ,(1994)
Valeriu Beiu, John G Taylor, None, Optimal Mapping of Neural Networks onto FPGA's - A New Constructive Algorithm - international work-conference on artificial and natural neural networks. pp. 822- 829 ,(1995) , 10.1007/3-540-59497-3_256
Avrim L. Blum, Ronald L. Rivest, Original Contribution: Training a 3-node neural network is NP-complete Neural Networks. ,vol. 5, pp. 117- 127 ,(1992) , 10.1016/S0893-6080(05)80010-3
Wolfgang Hess, Speech enhancement: edited by Yae S. Lim, Massachusetts Institute of Technology, Cambridge, MA, U.S.A. In: Prentice-Hall Signal Processing Series, edited by A.V. Oppenheim. Publishers: Prentice-Hall, Inc., Englewood Cliffs, NJ 07632, U.S.A., 1983, xi + 363 pp Signal Processing. ,vol. 12, pp. 331- 333 ,(1987) , 10.1016/0165-1684(87)90104-6
Ingo Wegener, The Complexity of Boolean Functions ,(1991)
Umesh V. Vazirani, Michael J. Kearns, An Introduction to Computational Learning Theory ,(1994)
Hugo de Garis, EVOLVABLE HARDWARE Genetic Programming of a Darwin Machine Springer, Vienna. pp. 441- 449 ,(1993) , 10.1007/978-3-7091-7533-0_64
Jiří Šíma, Back-propagation is not efficient Neural Networks. ,vol. 9, pp. 1017- 1023 ,(1996) , 10.1016/0893-6080(95)00135-2
P Carnevali, S Patarnello, Exhaustive Thermodynamical Analysis of Boolean Learning Networks EPL. ,vol. 4, pp. 1199- 1204 ,(1987) , 10.1209/0295-5075/4/10/020
Valeriu Beiu, John G Taylor, None, On the circuit complexity of sigmoid feedforward neural networks Neural Networks. ,vol. 9, pp. 1155- 1171 ,(1996) , 10.1016/0893-6080(96)00130-X