Abstract algebraic structure of analytic theory of algorithms (Q1069295)

The paper aims to give a general definition of algorithm in any abstract data structure. The crucial point is a notion of a quasialgorithm; namely, a generator of quasialgorithms is a quintuple \((\bar A,\bar X,\bar Y,\tilde W,\tilde A)\) where \(\bar A\) is a set of quasialgorithms, \(\bar X\) is a set oforiginal data, \(\bar Y\) is a set of results, \(\tilde W\) is a generating function \(\tilde W:\) \(\bar A\times \bar X^ n\to \bar Y\) and \(\tilde A\) is a set of functions from \(\bar X^ n\) into \(\bar Y.\) A generator must satisfy the condition \(\tilde W(\bar A,\bar X_ 1,\ldots,\bar X_ n)= \tilde A(\bar X_ 1,\ldots,\bar X_ n)\) and the effectiveness of this definition is concealed in the way in which \(\tilde W\) is defined. Some interesting subfamilies of quasialgorithms are presented in the paper, however no deep general applications of the introduced notion are shown.