Non recursive functionals
β Scribed by Richard Bird
- Publisher
- John Wiley and Sons
- Year
- 1975
- Tongue
- English
- Weight
- 345 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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