No label defined (Q3706487)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3934393
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3934393

      Statements

      0 references
      0 references
      1982
      0 references
      survey
      0 references
      unsolvability of mass problems
      0 references
      constructive semantics
      0 references
      computable analysis
      0 references
      random sequences
      0 references
      measures of information
      0 references
      [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.
      0 references

      Identifiers