| Original language | English |
|---|---|
| Pages (from-to) | 44-61 |
| Number of pages | 18 |
| Journal | Journal of Computer and System Sciences |
| Volume | 10 |
| Issue number | 1 |
| DOIs | |
| State | Published - Feb 1975 |
| Externally published | Yes |
Bibliographical note
Funding Information:It has been pointed out in various ways (see especially \[5 and i0\]) that there are procedures which are obviously "effectively computable" but cannot be described by program schemata. Program schemata have been augmented in various ways by allowing the use of devices such as pushdown stores or of recursive definitions, etc. Various classes of programs have been thus defined and their relative strength studied (see all the references except \[6, 7 and 9\]). A natural problem which arose was to find a mathematical definition which would capture the intuitive notion of "effective procedure" and then to find classes of programs which are "universal" in the sense that they are able to describe any effective procedure. One suggestion for such a * This research was supported by NSF Grant GJ 33 at the University of Southern California Los Angeles, CA. The author's present address is Dartmouth College, Hanover, NH 03755.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics