Please use this identifier to cite or link to this item:
Title: Computation models and algebra of algorithms
Authors: Ovsyak, V. K.
Bibliographic description (Ukraine): Ovsyak K. V. Computation models and algebra of algorithms / K. V. Ovsak // Вісник Національного університету "Львівська політехніка". – 2008. – № 621 : Інформаційні системи та мережі. – С. 3-18. – Бібліографія: 21 назва.
Issue Date: 2008
Publisher: Видавництво Національного університету "Львівська політехніка"
Abstract: An analysis of the existing, intuitive computation models is presented, that is the virtual machines of Turing, Post, Kolmogorov, Schönhage, Aho-Ullman-Hopcroft as well as the algorithms of Markov and Krinitski, and the recursive functions. The need for tools of precise, mathematical formulation and possible transformation of the algorithms is indicated. Consequently, an algebra of algorithms is defined using the axiomatic method. The algebra is based on the operations of sequencing, elimination, paralleling and inverting as well as cyclic sequencing, cyclic elimination and cyclic paralleling, all of them performed on the so-called uniterms.
Content type: Article
Appears in Collections:Інформаційні системи та мережі. – 2008. – №621

Files in This Item:
File Description SizeFormat 
01.pdf172,93 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.