Agent-environment approach to the simulation of Turing machines by neural networks
暂无分享,去创建一个
[1] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[2] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[3] Srimat T. Chakradhar,et al. First-order versus second-order single-layer recurrent neural networks , 1994, IEEE Trans. Neural Networks.
[4] M. Goudreau,et al. First-order vs. Second-order Single Layer Recurrent Neural Networks , 1994 .
[5] Yurii Rogozhin,et al. Small Universal Turing Machines , 1996, Theor. Comput. Sci..
[6] A. J. Wells,et al. Turing's Analysis of Computation and Theories of Cognitive Architecture , 1998, Cogn. Sci..
[7] Mikel L. Forcada,et al. Stable Encoding of Finite-State Machines in Discrete-Time Recurrent Neural Nets with Sigmoid Units , 2000, Neural Computation.
[8] Y. C. Lee,et al. Turing equivalence of neural networks with second order connection weights , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.
[9] W. Pitts,et al. A Logical Calculus of the Ideas Immanent in Nervous Activity (1943) , 2021, Ideas That Created the Future.
[10] Hava T. Siegelmann,et al. Computational capabilities of recurrent NARX neural networks , 1997, IEEE Trans. Syst. Man Cybern. Part B.
[11] Herbert A. Simon,et al. Situated Action: A Symbolic Interpretation , 1993, Cogn. Sci..
[12] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[13] Eduardo D. Sontag,et al. Analog Neural Nets with Gaussian or Other Common Noise Distributions Cannot Recognize Arbitrary Regular Languages , 1999, Neural Computation.
[14] Hava T. Siegelmann,et al. On the Computational Power of Neural Nets , 1995, J. Comput. Syst. Sci..
[15] James G. Greeno,et al. Situativity and Symbols: Response to Vera and Simon , 1993, Cogn. Sci..