Algorithms and algorithmic problems

From MaRDI portal





This article is devoted to constructing the axiomatics of algorithm theory and programming theory. A number of basic axioms for these theories are distinct and various consequences from them are obtained. The questions of realizability, determinability, calculability, and solvability of functions for sets and the solvability of algorithmic problems are investigated.











This page was built for publication: Algorithms and algorithmic problems

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