Computational and computer complexity of analogic cellular wave computers

Research output: Contribution to journalArticle

36 Citations (Scopus)

Abstract

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
Volume12
Issue number4
DOIs
Publication statusPublished - Aug 2003

Fingerprint

Computational complexity
Energy dissipation

Keywords

  • CNN
  • Computational complexity
  • Universal Machine on flows

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Computational and computer complexity of analogic cellular wave computers. / Roska, T.

In: Journal of Circuits, Systems and Computers, Vol. 12, No. 4, 08.2003, p. 539-562.

Research output: Contribution to journalArticle

@article{5f7f2b7f6f8c4bab8b9abdf52e531ce9,
title = "Computational and computer complexity of analogic cellular wave computers",
abstract = "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.",
keywords = "CNN, Computational complexity, Universal Machine on flows",
author = "T. Roska",
year = "2003",
month = "8",
doi = "10.1142/S0218126603001021",
language = "English",
volume = "12",
pages = "539--562",
journal = "Journal of Circuits, Systems and Computers",
issn = "0218-1266",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Computational and computer complexity of analogic cellular wave computers

AU - Roska, T.

PY - 2003/8

Y1 - 2003/8

N2 - 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.

AB - 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.

KW - CNN

KW - Computational complexity

KW - Universal Machine on flows

UR - http://www.scopus.com/inward/record.url?scp=0346907064&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0346907064&partnerID=8YFLogxK

U2 - 10.1142/S0218126603001021

DO - 10.1142/S0218126603001021

M3 - Article

VL - 12

SP - 539

EP - 562

JO - Journal of Circuits, Systems and Computers

JF - Journal of Circuits, Systems and Computers

SN - 0218-1266

IS - 4

ER -