A theorem of representation for primitive recursive algorithms, Fundamenta Informaticae XX, pp.1-18, 2010. ,
Algorithmique et langages de programmation, Bulletin de l'EPI, vol.64, pp.115-124, 1991. ,
URL : https://hal.archives-ouvertes.fr/edutice-00001071
Palindrome recognition using a multidimensional tape, Theoretical Computer Science, vol.302, issue.1-3, pp.475-480, 2003. ,
Algorithms vs. Machines, Bulletin of the European Association for Theoretical Computer Science Number, vol.77, pp.96-118, 2002. ,
Abstract state machines capture parallel algorithms, ACM transactions on Computational Logic, vol.9, issue.3, 2008. ,
When are two algorithms the same?, Bull. Symbolic Logic, vol.15, issue.2, pp.145-168, 2009. ,
A Machine-Independent Theory of the Complexity of Recursive Functions, Journal of the ACM, vol.14, issue.2, pp.322-336, 1967. ,
Abstract State Machines: A Unifying View of Models of Computation and of System Design Frameworks, Annals of Pure and Applied Logic, vol.133, issue.1-3, pp.149-171, 2005. ,
Normalization of Some Extended Abstract State Machines, Fields of Logic and Computation, Lecture Notes in Computer Science, vol.6300, pp.165-180, 2010. ,
, About primitive recursive algorithms, vol.83, pp.57-69, 1991.
, Mathematical Logic: A Course With Exercises : Part I and II, vol.13, pp.978-0198500483, 2000.
ASM and Operational Algorithmic Completeness of Lambda Calculus, Fields of Logic and Computation, 2010. ,
Universal Plug and Play Machine Models, Proc. of IFIP World Computer Congress, pp.21-30, 2002. ,
Evolving Multialgebras unify all usual models for computation in sequential time, Symposium on Theoretical Aspects of Computer Science, 2010. ,
, Classes of Algorithms: Formalization and Comparison, vol.107, pp.95-127, 2012.
Sequential Abstract State Machines Capture Sequential Algorithms, ACM Transactions on Computational Logic, vol.1, issue.1, pp.77-111, 2000. ,
Interactive Algorithms, Mathematical Foundations of Computer Science, pp.26-38, 2005. ,
The Static and Dynamic Semantics of C, 2000. ,
LOGSPACE and PTIME characterized by programming languages, Theoretical Computer Science, vol.228, issue.1-2, pp.151-174, 1999. ,
Recursive predicates and quantifiers, Transactions of the AMS, vol.53, issue.1, pp.41-73, 1943. ,
A call-by-name lambda-calculus machine, Higher Order and Symbolic Computation, vol.20, pp.199-207, 2007. ,
, Caractérisation impérative des algorithmes séquentiels en temps quelconque
Algorithmic Completeness of Imperative Programming Languages (Long Version), dr-apeiron ,
An Imperative Language Complete for PTime Algorithms, 2016. ,
, The complexity of loop programs, ACM 22nd national conference, pp.465-469, 1967.
, What is an algorithm?, Mathematics Unlimited, pp.919-936, 2001.
, On Primitive Recursive Algorithms and the Greatest Common Divisor Function, vol.301, pp.487-492, 2003.
Computability and Recursion, Bulletin of Symbolic Logic, vol.2, issue.3, pp.284-321, 1996. ,
On Computable Numbers, with an Application to the Entscheidungsproblem, Proc. London Math. Soc, vol.42, issue.2, pp.230-265, 1937. ,
Towards a Definition of an Algorithm, Journal of Logic and Computation, vol.21, issue.2, pp.253-286, 2010. ,
, Galois Theory of Algorithms, Kolchin Seminar in Differential Algebra. 2010