Computational and computer complexity of analogic cellular wave computers

Abstract

Computational complexity and computer complexity issues are studied in different architectural settings. Three mathematical machines are considered: the universal machine on integers (UMZ), the universal machine on reals (UMR) and the universal machine on flows (UMF). The three machines induce different kinds of computational difficulties: combinatorial, algebraic, and dynamic, respectively. After a broader overview of computational complexity issues, it is shown, following the reasoning related the UMR, that in many cases the size is not the most important parameter related to computational complexity. Emerging new computing and computer architectures as well as their physical implementation suggest a new look at computational and computer complexities. The new analogic cellular array computer paradigm based on the CNN Universal Machine (generalized to UMF), and its physical implementation in CMOS and optical technologies, proves experimentally the relevance of the role of accuracy and problem parameter role in computational complexity, as well as the need of rigorous definition of computational complexity for UMF. It is also shown that choosing the spatial temporal elementary instructions, as well as taking into account the area and power dissipation, these choices inherently influence computational complexity and computer complexity, respectively. Comments related to biology relevance of the UMF are presented in relation to complexity theory. It is shown that algorithms using spatial-temporal continuous elementary instructions (a-recursive functions) represent not only a new world in computing, but also a more general type of logic inferencing.