𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completeness problems in classes of computable named functions

✍ Scribed by D. B. Bui; B. V. Gubskii; V. N. Red'ko

Publisher
Springer US
Year
1989
Tongue
English
Weight
988 KB
Volume
24
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Augmented loop languages and classes of
Augmented loop languages and classes of computable functions
✍ Michael Machtey πŸ“‚ Article πŸ“… 1972 πŸ› Elsevier Science 🌐 English βš– 1024 KB

A classification of all the computable functions is given in terms of subrecursive programming languages. These classes are those which arise from the relation "primitive recursive in." By distinguishing between honest and dishonest classes the classification is related to the computational complexi