By Topic

The CNN Universal Machine is as universal as a Turing Machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. R. Crounse ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; L. O. Chua

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

Published in:

IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications  (Volume:43 ,  Issue: 4 )