HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Algorithmic Completeness of Imperative Programming Languages

Abstract : According to the Church-Turing Thesis, effectively calculable functions are functions computable by a Turing machine. Models that compute these functions are called Turing-complete. For example, we know that common imperative languages (such as C, Ada or P ython) are Turing complete (up to unbounded memory). Algorithmic completeness is a stronger notion than Turing-completeness. It focuses not only on the input-output behavior of the computation but more importantly on the step-by-step behavior. Moreover, the issue is not limited to partial recursive functions, it applies to any set of functions. A model could compute all the desired functions, but some algorithms (ways to compute these functions) could be missing (see [10, 27] for examples related to primitive recursive algorithms). This paper's purpose is to prove that common imperative languages are not only Turing-complete but also algorithmically complete, by using the axiomatic definition of the Gurevich's Thesis and a fair bisimulation between the Abstract State Machines of Gurevich (defined in [16]) and a version of Jones' While programs. No special knowledge is assumed, because all relevant material will be explained from scratch.
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download

Contributor : Yoann Marquer Connect in order to contact the contributor
Submitted on : Friday, April 3, 2020 - 4:13:33 PM
Last modification on : Wednesday, November 3, 2021 - 9:23:47 AM


Publisher files allowed on an open archive




Yoann Marquer. Algorithmic Completeness of Imperative Programming Languages. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2019, 168 (1), pp.51 - 77. ⟨10.3233/FI-2019-1824⟩. ⟨hal-02524486⟩



Record views


Files downloads