Semantics-to-Syntax Analyses of Algorithms

DOI10.1007/978-3-319-22156-4_7MaRDI QIDQ4637221zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmscomputabilityabstract state machinesChurch's thesissequential algorithmhuman 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)

Recommendations

• Semantics of algorithmic languages
• scientific article; zbMATH DE number 3862407
• An algebraic approach to semantics of programming languages
• scientific article; zbMATH DE number 3892570
• scientific article; zbMATH DE number 3967883
• On syntactical analysis and properties of formal programming languages
• Efficient program synthesis: semantics, logic, complexity
• The implementation of syntax analysis using ALGOL, and some mathematical applications
• scientific article; zbMATH DE number 3972168

Cites work

• scientific article; zbMATH DE number 3146798 (Why is no real title available?)
• scientific article; zbMATH DE number 3728250 (Why is no real title available?)
• scientific article; zbMATH DE number 2155189 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• scientific article; zbMATH DE number 3081677 (Why is no real title available?)
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• A relational model of data for large shared data banks
• Abstract state machines capture parallel algorithms
• Collected works of A. M. Turing. Mathematical logic. Edited by R. O. Gandy and C. E. M. Yates. Including prefaces by Solomon Feferman
• Evolving Algebras 1993: Lipari Guide
• Foundational analyses of computation
• Interactive Small-Step Algorithms I: Axiomatization
• Kolmogorov and mathematical logic
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Ordinary interactive small-step algorithms. I
• Sequential abstract-state machines capture sequential algorithms
• What is an algorithm?
• When are Two Algorithms the Same?

Cited in

(5)

• Why Turing’s Thesis Is Not a Thesis
• Reversible Top-Down Syntax Analysis
• A syntactic view of computational adequacy
• Foundational analyses of computation
• On collecting semantics for program analysis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637221)