What Is an Algorithm?

DOI10.1007/978-3-642-27660-6_3zbMath1298.68091OpenAlexW2149203488MaRDI QIDQ2891359

Yuri Gurevich

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_3

Mathematics Subject Classification ID

Turing machines and related notions (03D10) General topics in the theory of algorithms (68W01)

Related Items

What is the Church-Turing Thesis? ⋮ Execution trace sets for real computation ⋮ The instructional information processing account of digital computation ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Semantics-to-Syntax Analyses of Algorithms

Cites Work

• Fixed-point extensions of first-order logic
• Datalog extensions for database queries and updates
• Palindrome recognition using a multidimensional tape.
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Abstract state machines capture parallel algorithms
• Ordinary interactive small-step algorithms, I
• Church Without Dogma: Axioms for Computability
• Interactive Small-Step Algorithms I: Axiomatization
• Sequential abstract-state machines capture sequential algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item