Semantics-to-Syntax Analyses of Algorithms

DOI10.1007/978-3-319-22156-4_7zbMath1474.68471OpenAlexW2419604353MaRDI QIDQ4637221

Yuri Gurevich

Publication date: 18 April 2018

Published in: Turing’s Revolution (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22156-4_7

zbMATH Keywords

Church's thesisanalysis of algorithmssequential algorithmcomputabilityabstract state machineshuman computersTuring's thesisconcept of algorithmsdefinition of algorithmssemantics-to-syntax analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Turing machines and related notions (03D10) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (1)

Why Turing’s Thesis Is Not a Thesis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• What Is an Algorithm?
• Foundational Analyses of Computation
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• When are Two Algorithms the Same?
• Kolmogorov and mathematical logic
• Evolving Algebras 1993: Lipari Guide
• Abstract state machines capture parallel algorithms
• Ordinary interactive small-step algorithms, I
• Interactive Small-Step Algorithms I: Axiomatization
• A relational model of data for large shared data banks
• Sequential abstract-state machines capture sequential algorithms
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Semantics-to-Syntax Analyses of Algorithms