A Representation Theorem for Primitive Recursive Algorithms

DOI10.3233/FI-2011-405zbMath1252.68114OpenAlexW1498119625MaRDI QIDQ2895767

Bruno Patrou, Pierre Valarcher, Philippe Andary

Publication date: 4 July 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-405

zbMATH Keywords

algorithmsabstract state machinesprimitive recursionstructural complexity

Mathematics Subject Classification ID

Theory of programming languages (68N15) Recursive functions and relations, subrecursive hierarchies (03D20) General topics in the theory of algorithms (68W01)

Related Items (1)

Primitive recursion in the abstract

This page was built for publication: A Representation Theorem for Primitive Recursive Algorithms