| Issue |
RAIRO-Theor. Inf. Appl.
Volume 42, Number 1, January-March 2008
A nonstandard spirit among computer scientists:a tribute to Serge Grigorieff at the occasion of his 60th birthday
|
|
|---|---|---|
| Page(s) | 69 - 82 | |
| DOI | https://doi.org/10.1051/ita:2007053 | |
| Published online | 18 January 2008 | |
A complete characterization of primitive recursive intensional behaviours
LACL, Université Paris Est, France; valarcher@univ-paris12.fr
We give a complete characterization of the class of functions that are the intensional behaviours of primitive recursive (PR) algorithms. This class is the set of primitive recursive functions that have a null basic case of recursion. This result is obtained using the property of ultimate unarity and a geometrical approach of sequential functions on N the set of positive integers.
Mathematics Subject Classification: 68Q25 / 68Q55 / 68W40
Key words: Intensional behaviour / semantics / primitive recursion
© EDP Sciences, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.