𝔖 Bobbio Scriptorium
✦   LIBER   ✦

n-Ary Almost Recursive Functions

✍ Scribed by John W. Berry

Publisher
John Wiley and Sons
Year
1974
Tongue
English
Weight
530 KB
Volume
20
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Learning Recursive Functions from Approx
Learning Recursive Functions from Approximations
✍ John Case; Susanne Kaufmann; Efim Kinber; Martin Kummer πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 467 KB

This article investigates algorithmic learning, in the limit, of correct programs for recursive functions f from both inputΓ‚output examples of f and several interesting varieties of approximate additional (algorithmic) information about f. Specifically considered, as such approximate additional info

Hierarchies of Primitive Recursive Funct
Hierarchies of Primitive Recursive Functions
✍ Charles Parsons πŸ“‚ Article πŸ“… 1968 πŸ› John Wiley and Sons 🌐 English βš– 972 KB

9 Yn), ~1 , \* \* . ? ~n l then the definition of 97 is of degree max ( p ) q) + 1 . l) l ) We omit from consideration the schema for recursion without pareymeters. It can be accommodated into our arguments by simplified versions of the arguments for (V), or it can be omitted as a primitive schema w

Non recursive functionals
Non recursive functionals
✍ Richard Bird πŸ“‚ Article πŸ“… 1975 πŸ› John Wiley and Sons 🌐 English βš– 345 KB
q-ary Bent Functions Constructed from Ch
q-ary Bent Functions Constructed from Chain Rings
✍ Xiang-dong Hou πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 276 KB

A chain ring is a finite local principal ideal ring. q-ary bent functions are constructed from chain rings which are free Z O -modules. A construction combining such bent functions is also given.