scientific article; zbMATH DE number 4052988

From MaRDI portal
Publication:3789046





The author investigates some models of computing formulated as the aggregate of the dependencies - these are schemes of functions of the following type: \(f: R\to (A_ 1,\dots,A_ k\to A)\). The sense of this notation is that if the condition R is true then \(A=f(A_ 1,\dots,A_ k).\) The classification of computing models by the types of dependencies is given. Different kinds and regimes of the solutions of computing tasks are considered. The main difference is indicated between particular solutions of computing tasks (which are presented by the terms) and general ones (obtained by the interpretation of the computing models by recursive program schemes). For each of the types of computing models and for all regimes and kinds of solutions the problems of analysis and synthesis are formulated, as well as algorithmic problems connected with them. There are algorithms with linear complexity for analysis and synthesis for some simple models [cf. the author, Programmirovanie 1985, No. 3, 38--49 (1985)].












This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3789046)