The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

A complete characterization of primitive recursive intensional behaviours

P. Valarcher — 2008

RAIRO - Theoretical Informatics and Applications

We give a complete characterization of the class of functions that are the intensional behaviours of (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 the set of positive integers.

Page 1

Download Results (CSV)