Computability over The Partial Continuous Functionals

We show that to every recursive total continuous functional there is a representative of in the hierearchy of partial continuous functionals such that is S1 - S9 computable over the hierarchy of partial continuous functionals. Equivalently, the representative will be PCF-definable over the partial continuous functionals, where PCF is Plotkin's programming language for computable functionals.

• Type: Journal
• Year: 2000
• Where: JSYML
• Authors: Dag Normann
• Keywords: Continuous Functionals, JSYML 2000, Partial Continuous Functionals, Recursive Total