DocumentCode :
1744917
Title :
AnaLogic Wave Computers-wave-type algorithms: canonical description, computer classes, and computational complexity
Author :
Roska, T.
Author_Institution :
Comput.. & Automation Res. Inst., Budapest, Hungary
Volume :
3
fYear :
2001
fDate :
6-9 May 2001
Firstpage :
41
Abstract :
We introduce the AnaLogic Wave Computer in an algorithmic way by introducing the a-recursive functions. We show that elementary waves can be used for practical purposes and describe a new algorithmic thinking, motivated by practical and nature made experience. Next, three types of computational paradigms (Turing machine on integers, Newton machine on reals and CNN Universal Machine on flows) and the respective computational complexities are introduced based on practical and physical measures, along with some of their surprising properties
Keywords :
Turing machines; cellular arrays; cellular neural nets; computational complexity; hybrid computers; AnaLogic Wave Computers; CNN Universal Machine; Newton Machine; Turing Machine; a-recursive functions; algorithmic thinking; canonical description; computational complexity; computational paradigms; wave-type algorithms; Cellular neural networks; Computational complexity; Computer architecture; Logic circuits; Logic programming; Microprocessors; Operating systems; Partial differential equations; Physics computing; Turing machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7803-6685-9
Type :
conf
DOI :
10.1109/ISCAS.2001.921241
Filename :
921241
Link To Document :
بازگشت