What is an algorithm?
From MaRDI portal
Recommendations
Cites work
- A Natural Axiomatization of Computability and Proof of Church's Thesis
- Abstract state machines capture parallel algorithms
- Church Without Dogma: Axioms for Computability
- Datalog extensions for database queries and updates
- Elementary algorithms and their implementations
- Fixed-point extensions of first-order logic
- scientific article; zbMATH DE number 1687041 (Why is no real title available?)
- scientific article; zbMATH DE number 1820018 (Why is no real title available?)
- scientific article; zbMATH DE number 5604097 (Why is no real title available?)
- scientific article; zbMATH DE number 3728250 (Why is no real title available?)
- scientific article; zbMATH DE number 1951198 (Why is no real title available?)
- scientific article; zbMATH DE number 1984273 (Why is no real title available?)
- scientific article; zbMATH DE number 1869994 (Why is no real title available?)
- scientific article; zbMATH DE number 5224002 (Why is no real title available?)
- Interactive Small-Step Algorithms I: Axiomatization
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Ordinary interactive small-step algorithms. I
- Palindrome recognition using a multidimensional tape.
- Sequential abstract-state machines capture sequential algorithms
Cited in
(7)- Execution trace sets for real computation
- scientific article; zbMATH DE number 3934392 (Why is no real title available?)
- The universal algorithm
- Theses for computation and recursion on concrete and abstract structures
- Semantics-to-Syntax Analyses of Algorithms
- The instructional information processing account of digital computation
- What is the Church-Turing Thesis?
This page was built for publication: What is an algorithm?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891359)