scientific article; zbMATH DE number 3934393
[For the entire collection see Zbl 0551.00012.] [English version in Lect. Notes Comput. Sci. 122, 100-234 (1981; Zbl 0477.68035).] The paper gives a survey on the discoveries in the theory of algorithms and its mathematical applications. The paper consists of two parts; the first part presents the main discoveries in the general theory of algorithms, and the second part presents the applications of this theory to some problems of mathematics, such as: unsolvability of mass problems, constructive semantics, computable analysis, random sequences, measures of information, etc. The paper is distinguished by a deep analysis of the nature of notions, and of the relations between basic notions and fundamental results in the theory of algorithms. The sections concerning the Kolmogorov's machines and the computation of Kolmogorov's type, the definitions of random sequences and of measure of information etc., are presented in detail with an interesting analysis.
- scientific article; zbMATH DE number 3077776
- scientific article; zbMATH DE number 3092551
- scientific article; zbMATH DE number 3966050
- scientific article; zbMATH DE number 193197
- scientific article; zbMATH DE number 3197110
- scientific article; zbMATH DE number 108379
- scientific article; zbMATH DE number 4028893
- Introduction to algorithm theory
- Algorithms and algorithmic problems
- Structures computable in polynomial time. II
- Algorithmic search in group theory
- Existence and uniqueness of structures computable in polynomial time
- scientific article; zbMATH DE number 4028893 (Why is no real title available?)
- scientific article; zbMATH DE number 1301806 (Why is no real title available?)
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 Q3706487)