DocumentCode
778335
Title
The CNN Universal Machine is as universal as a Turing Machine
Author
Crounse, Kenneth R. ; Chua, Leon O.
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA
Volume
43
Issue
4
fYear
1996
fDate
4/1/1996 12:00:00 AM
Firstpage
353
Lastpage
355
Abstract
It is shown that the simplest integrated circuit implementations of the CNN Universal Machine can play the “game of life”, and are therefore equivalent to Turing Machines. In addition, a constructive proof is given for the direct implementation of general first-order cellular automata on such machines
Keywords
Turing machines; cellular automata; cellular neural nets; CNN Universal Machine; Turing Machine; cellular automata; game of life; integrated circuit; Automata; Automatic control; Cellular networks; Cellular neural networks; Chip scale packaging; Computer languages; Games; Logic; Registers; Turing machines;
fLanguage
English
Journal_Title
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
Publisher
ieee
ISSN
1057-7122
Type
jour
DOI
10.1109/81.488819
Filename
488819
Link To Document