Minimisation Vs. Recursion on the Partial Continuous Functionals
by
Ulrich Berger
| Citations: | 2 - 1 self |
BibTeX
@MISC{Berger_minimisationvs.,
author = {Ulrich Berger},
title = {Minimisation Vs. Recursion on the Partial Continuous Functionals},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We study the relationship between minimisation and recursion on the partial continuous functionals of nite types. We prove that already at type level two minimisation is weaker than recursion. 1
Citations
| 363 | LCF considered as a programming language - Plotkin - 1977 |
| 249 | Domains for Denotational Semantics - Scott - 1982 |
| 112 | eine bisher noch nicht benutzte Erweiterung des finiten Standpunktes, Dialectica, Vol: 12 - Godel, Uber - 1958 |
| 65 | Interpretation of analysis by means of constructive functionals of finite type - Kreisel - 1959 |
| 39 | Countable functionals - Kleene - 1959 |
| 28 | Foundations of Recursion Theory - Platek - 1966 |
| 21 | Correct and optimal implementations of recursion in a simple programming language - Vuillemin - 1974 |
| 13 | Computability over the partial continuous functionals - Normann - 1998 |
| 2 | Computability and continuity in types - Bergstra - 1976 |
| 2 | Sequentially and parallely computable functionals - Sazonov - 1975 |
| 2 | Relationships between classes of monotonic functions - Trakhtenbrot - 1976 |
| 1 | Recursive functionals and quanti of nite type I - Kleene - 1959 |
