Referenced Items are not available for this document.
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:
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
(Volume:43
,
Issue:
4
)
Date of Publication: Apr 1996
- Page(s):
- 353 - 355
- ISSN :
- 1057-7122
- INSPEC Accession Number:
- 5260583
- Digital Object Identifier :
- 10.1109/81.488819
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Apr 1996
- Sponsored by :
- IEEE Circuits and Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
