Subrecursion as Basis for a Feasible Programming Language (1994)
| Venue: | Proceedings of CSL'94, number 933 in LNCS |
| Citations: | 9 - 8 self |
BibTeX
@INPROCEEDINGS{Voda94subrecursionas,
author = {Paul J. Voda},
title = {Subrecursion as Basis for a Feasible Programming Language},
booktitle = {Proceedings of CSL'94, number 933 in LNCS},
year = {1994},
pages = {324--338},
publisher = {Springer Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We are motivated by finding a good basis for the semantics of programming languages and investigate small classes in subrecursive hierarchies of functions. We do this with the help of pairing functions because in this way we can explore the amazing coding powers of S-expressions of LISP within the domain of natural numbers. In the process of doing this we introduce a missing stage in Grzegorczyk-based hierarchies which solves the longstanding open problem of what is the precise relation between the small recursive classes and those of complexity theory. 1 Introduction We investigate subrecursive hierarchies based on pairing functions and solve a longstanding open problem in small recursive classes of what is the relationship between these and computational complexity classes (see [11]). The problem is solved by discovering that there is a missing stage in Grzegorczyk-based hierarchies [7, 11]. The motivation for this research comes from our search for a good programming langu...
Citations
| 476 | Concrete Mathematics - Graham, Knuth, et al. - 1989 |
| 129 | The intrinsic computational difficulty of functions - Cobham - 1964 |
| 92 | Computability and Unsolvability - Davis - 1958 |
| 50 | Subrecursion: functions and hierarchies - Rose - 1984 |
| 36 | Some classes of recursive functions - Grzegorczyk - 1953 |
| 35 | Classes of predictably computable functions - Ritchie |
| 22 | Finitary Inductively Presented Logics - Feferman - 1988 |
| 18 | Constant time factors do matter - Jones - 1993 |
| 11 | Einfuhrung in die Komplexitatstheorie - Reischuk - 1990 |
| 9 | Types of Trilogy - Voda - 1988 |
| 3 | Types as Values Polymorphism - Borovansky, Voda - 1993 |
| 1 | Small Grzegorczyk classes and limited minimum - Harrow - 1975 |
| 1 | The Polynomial-Time Hierachy, Theor - Stockmeyer - 1977 |
