On the asymptotic behaviour of primitive recursive algorithms

In our application, the recursive neural network is trained using a conveniently generated pattern set where each pattern corresponds to a road intersection scene encoded by means

The proof of the main theorem needs a diÆcult combinatorial result (proposition.. 18) which has some interest

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

The aims of this work were: (1) to show that the same general tools needed to prove the existence and uniqueness of uninterpreted solutions of recursive program

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

On donne pour ce langage des règles de traduction systématiques qui associent aux programmes des des- cripteurs de complexité représentant les coûts moyens sous forme de série

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

A well known property of primitive recursive functions which we shall use is the fact that it is possible to enumerate the. set N* in an one-to-one way, making use of