Computational and computer complexity of analogic cellular wave computers

Research output: Contribution to journalArticle

36 Citations (Scopus)


Computational complexity of analogic cellular wave computers is discussed. The complexity of three mathematical machines, the universal machine of integers (UMZ), the universal machine of reals (UMR) and the universal machine of flows (UMF) is described. The definition of computational complexity for UMF is introduced. It is shown that the choices of spatial temporal elementary instructions and taking into account the area and power dissipation, influence the computational complexity and computer complexity respectively.

Original languageEnglish
Pages (from-to)539-562
Number of pages24
JournalJournal of Circuits, Systems and Computers
Issue number4
Publication statusPublished - Aug 1 2003



  • CNN
  • Computational complexity
  • Universal Machine on flows

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this