DocumentCode
2395959
Title
Modern State of Algorithms and Systems Complication Theory
Author
Cherkaskyy, Mykola
Author_Institution
Lviv Polytech. Nat. Univ., Lviv
fYear
2006
fDate
Feb. 28 2006-March 4 2006
Firstpage
5
Lastpage
10
Abstract
The modern state of the applied theory of abstract and computer algorithms and systems is considered. In the first part the state of the theory and the practical use of formal and informal systems of abstract algorithms are shown. The second part is devoted to the theory of computer algorithms. The SH-model, H-model of algorithm and information characteristics of complexity is defined. In the final part the universal SH-model and the optimization ways of its complexity characteristics are described.
Keywords
Turing machines; SH model; Turing machine; abstract algorithms; computer algorithms; hardware software tools; information characteristics; systems complication theory; Arithmetic; Birth disorders; Concrete; Crystallization; History; Logic; Modems; Terminology; Testing; Turing machines; SH-model; Turing machine; algorithm; complexity characteristics; computer; hardware-software tools;
fLanguage
English
Publisher
ieee
Conference_Titel
Modern Problems of Radio Engineering, Telecommunications, and Computer Science, 2006. TCSET 2006. International Conference
Conference_Location
Lviv-Slavsko
Print_ISBN
966-553-507-2
Type
conf
DOI
10.1109/TCSET.2006.4404427
Filename
4404427
Link To Document