A hierarchy of primitive recursive sequence functions

the class of functions that are intensional behaviours of PRM (resp. PRA) systems is exactly the set of func- tions definable with prmn (resp. pran) (PRM with null basic case

If the operation of collecting together all previously defined functions is only repeated a finite number of times, then one obtains just those functions which

We investigate connections between categorical results of [Burroni], and ab- stract machines for primitive recursive algorithms, in the lineage of the Categori- cal Abstract

Toute utilisation commerciale ou impression systématique est constitutive d’une infrac- tion pénale.. Toute copie ou impression de ce fichier doit contenir la présente mention

Toute utilisation commerciale ou impression systématique est constitutive d’une infrac- tion pénale.. Toute copie ou impression de ce fichier doit contenir la présente mention

Somewhat later Gabriel [3] showed that the func- tions of the class Si played an important role in the solution of certain differential equations.. Singh for helpful

By Theorem 40 it is also evident that both the determined and the indeterminate case of problem (e) can occur.. Hence, if we change our problem by requiring

Clunie and Shiel-Small [3] showed that in a simply connected domain such functions can be written in the form f = h+g, where both h and g are analytic.. We call h the analytic part