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.

Displaying similar documents to “Comparisons between some generalizations of recursion theory”

A complete characterization of primitive recursive intensional behaviours

P. Valarcher (2008)

RAIRO - Theoretical Informatics and Applications

Similarity:

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.