𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Kernels of partially recursive functions naming computational complexity classes

✍ Scribed by A. S. Barashko; S. I. Roizen

Publisher
Springer US
Year
1977
Tongue
English
Weight
649 KB
Volume
12
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Complexity classes of partial recursive
Complexity classes of partial recursive functions
✍ Edward L. Robertson πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 738 KB

This paper studies possible extensions of the concept of complexity class of recursive functions to partial recursive functions. Many of the well-known results for total complexity classes are shown to have corresponding, though not exactly identical, statements for partial classes. In particular, w

The Computation of Partial Recursive Wor
The Computation of Partial Recursive Word-Functions Without Read Instructions
✍ Holger Petersen πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 422 KB πŸ‘ 1 views

## Abstract In this note we consider register‐machines with symbol manipulation capabilities. They can form words over a given alphabet in their registers by appending symbols to the strings already stored. These machines are similar to Post's normal systems and the related machine‐models discussed