Skip to Main content Skip to Navigation

Caractérisation impérative des algorithmes séquentiels en temps quelconque, primitif récursif ou polynomial

Abstract : Colson and Moschovakis results cast doubt on the ability of the primitive recursive model to compute a value by any means possible : the model may be complete for functions but there is a lack of algorithms. So the Church thesis express more what can be computed than how the computation is done. We use Gurevich thesis to formalize the intuitive idea of sequential algorithm by the Abstract States Machines (ASMs).We formalize the imperative programs by Jones' While language, and a variation LoopC of Meyer and Ritchie's language allowing to exit a loop if some condition is fulfilled. We say that a language characterizes an algorithmic class if the associated models of computations can simulate each other using a temporal dilatation and a bounded number of temporary variables. We prove that the ASMs can simulate While and LoopC, that if the space is primitive recursive then LoopC is primitive recursive in time, and that its restriction LoopC_stat where the bounds of the loops cannot be updated is in polynomial time. Reciprocally, one step of an ASM can be translated into a program without loop, which can be repeated enough times if we insert it onto a program in While for a general complexity, in LoopC for a primitive recursive complexity, and in LoopC_stat for a polynomial complexity.So While characterizes the sequential algorithms, LoopC the algorithms in primitive recursive space and time, and LoopC_stat the polynomial time algorithms
Document type :
Complete list of metadata

Cited literature [21 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Monday, February 29, 2016 - 4:02:14 PM
Last modification on : Friday, October 4, 2019 - 1:13:05 AM
Long-term archiving on: : Monday, May 30, 2016 - 3:13:45 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01280467, version 1



Yoann Marquer. Caractérisation impérative des algorithmes séquentiels en temps quelconque, primitif récursif ou polynomial. Informatique et langage [cs.CL]. Université Paris-Est, 2015. Français. ⟨NNT : 2015PESC1121⟩. ⟨tel-01280467⟩



Record views


Files downloads