Algorithmic completeness of imperative programming languages

DOI10.3233/FI-2019-1824MaRDI QIDQ5241417zbMATH OpenFDO

Authors Yoann Marquer

Publication date 31 October 2019

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2019-1824

zbMATH Keywords

algorithmic completenessASMcomputabilityimperative programmingsimulation

Mathematics Subject Classification ID

Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 5064388
• scientific article; zbMATH DE number 3938596
• Mathematical programming: Turing completeness and applications to software analysis
• A Natural Axiomatization of Computability and Proof of Church's Thesis
• Formalization of the computational theory of a Turing complete functional language model

Cited in

(3)

• Axiomatization and characterization of BSP algorithms
• Mathematical programming: Turing completeness and applications to software analysis
• scientific article; zbMATH DE number 1042220 (Why is no real title available?)

This page was built for publication: Algorithmic completeness of imperative programming languages

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