scientific article; zbMATH DE number 3934392
From MaRDI portal
Publication:3706486
[For the entire collection see Zbl 0551.00013.] [English version in Lect. Notes Comput. Sci. 122, 355-360 (1981; Zbl 0477.68035.] By an analysis of the notion of algorithm the paper gives answers or discussions to the following problems: definition of the notion of algorithm in terms of other standard mathematical notions; generalisation of Church's thesis for the computability by probabilistic and nondeterministic machines, and for the computability for other object domains; relativized computability; and algorithms over real numbers.
Recommendations
Cited in
(20)- Turing oracle machines, online computing, and three displacements in computability theory
- Algorithmic analysis of mixed computations
- Algorithms, nymphs, and shepherds
- Nonalgorithmic discrete procedures
- What is an algorithm?
- A computational definition of the notion of vectorial space
- What is an algorithm?
- Algorithmic Differentiation of Code with Multiple Context-Specific Activities
- scientific article; zbMATH DE number 3131414 (Why is no real title available?)
- scientific article; zbMATH DE number 3880674 (Why is no real title available?)
- When are Two Algorithms the Same?
- scientific article; zbMATH DE number 3909728 (Why is no real title available?)
- scientific article; zbMATH DE number 3936508 (Why is no real title available?)
- scientific article; zbMATH DE number 3977003 (Why is no real title available?)
- scientific article; zbMATH DE number 3982510 (Why is no real title available?)
- Algorithmic Procedures
- scientific article; zbMATH DE number 3557760 (Why is no real title available?)
- Why Turing’s Thesis Is Not a Thesis
- Algorithms and the mathematical foundations of computer science
- Elementary algorithms and their implementations
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 Q3706486)