The CNN universal machine. II. Programmability and applications

T. Roska; Leon O Chua

doi:10.1109/cnna.1992.274371

Abstract

1 min read

For pt.I, see ibid., p.1-10 (1992). The programmability (as a stored program) of the CNN universal machine is discussed. It is shown why and in which sense this machine is universal. The analogic type of algorithm is introduced. The application potential is reviewed and the biological relevance is analyzed. It is shown that the architecture is optimal not only for silicon implementations, but also for many biological information processing organs that have the same structure.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

Discussion(0)

No comments yet. Be the first to comment.

The CNN universal machine. II. Programmability and applications

Abstract

Discussion(0)

Related publications

CNN. II. Applications and VLSI circuit realizations

The CNN universal machine: an analogic array computer

The CNN is universal as the Turing machine

The CNN universal machine. I. The architecture

A fast, complex and efficient test implementation of the CNN Universal Machine

Related publications

Article2003
CNN. II. Applications and VLSI circuit realizations
Article2003

Article1993
The CNN universal machine: an analogic array computer
Article1993

Article1993
The CNN is universal as the Turing machine
Article1993

Article2003
The CNN universal machine. I. The architecture
Article2003

Article2002
A fast, complex and efficient test implementation of the CNN Universal Machine
Article2002