Turing machine simulation using hard-limiter neurons

IEEE International Conference on Neural Networks - Conference Proceedings

Volumn 4, Issue , 2004, Pages 3269-3274

  Chaudhari, Narendra S ^a   Dagdee, Nirmal ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SHRI G S INSTITUTE OF TECHNOLOGY AND SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ACTIVATION FUNCTIONS; HARD-LIMITER NEURONS; MACHINE TRANSITION; PIPELINED ACCESS MECHANISM;

COMPUTATIONAL COMPLEXITY; FLIP FLOP CIRCUITS; INTEGER PROGRAMMING; MACHINE DESIGN; NEURAL NETWORKS; PIPELINES; PROBLEM SOLVING; SIGNAL PROCESSING; THRESHOLD ELEMENTS;

TURING MACHINES;

EID: 10944266207     PISSN: 10987576     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IJCNN.2004.1381203     Document Type: Conference Paper

References (11)

1. W.S. McCulloch and W. Pitts, "A logical calculus of the ideas immanent in nervous actitivy," Bulletin of Mathematical Biophysics, vol. 5, pp. 115-133, 1943.
2. S.C.Kleene, "Representation of events in nerve nets and finite automata", Automata Studies, Princeton Univ. Press, 1956.
3. M. Arbib, "Turing Machines, Finite Automata and Neural Nets", Journal of ACM, pp. 467-475, 1961.
4. H.T. Siegelmann and E.D. Sontag, "On computational power of neural networks," Journal of Computer and System Sciences, vol. 50, No. 1, pp. 132-150, 1995.
5. M.L. Minsky, Computation: Finite and Infinite Machines, Englewood Cliffs: Prentice Hall, 1967.
6. C.W. Omlin and C. L. Giles, "Constructing Deterministic Finite-State Automata in Recurrent Neural Networks", Journal of ACM, Vol. 43, No. 6, pp. 937-972, 1996.
7. G.Z.Sun, H.-H.Chen, Y.C.Lee and C.L.Giles, "Turing equivalence of neural networks with second order connection weights", Proc. IEEE International Joint Conference on Neural Networks IJCNN'91, (1991), Vol. 2, pp. 357-362.
8. H.T. Siegelmann and E.D. Sontag, "Turing computability with neural nets," Applied Mathematics Letters, vol. 4, No. 6, pp. 77 -80, 1991.
9. H.T. Siegelmann, Neural Networks and Analog Computation: Beyond the Turing Limit, Boston: Birkhauser, 1999.
10. W. Maass, G. Schnitger and E.D. Sontag, "On the computational power of sigmoid verses Boolean threshold circuits," In, Proc. Thirty-second IEEE Symp. On Foundations of Computer Science, (1991)pp. 767-776.
11. J.H. Kim and S.-K. Park, "The geometrical learning of binary neural networks," IEEE Trans on Neural Networks, vol. 6, No. 1, pp 237-247, 1995.