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.
Recommendations
Cited in
(12)- Algebraic algorithmics: Theory and applications
- Preface: Super-recursive algorithms and hypercomputation.
- scientific article; zbMATH DE number 2084325 (Why is no real title available?)
- scientific article; zbMATH DE number 5986255 (Why is no real title available?)
- Algorithms and Constraint Programming
- scientific article; zbMATH DE number 5688248 (Why is no real title available?)
- scientific article; zbMATH DE number 3950242 (Why is no real title available?)
- Unconventional algorithms: complementarity of axiomatics and construction
- scientific article; zbMATH DE number 1301806 (Why is no real title available?)
- scientific article; zbMATH DE number 782630 (Why is no real title available?)
- Problems on Algorithms
- scientific article; zbMATH DE number 5497651 (Why is no real title available?)
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)