Abstract
In the previous chapter, we saw how the model PC offers a ‘maximal’ class of partial computable functionals strictly extending SF (in the sense of the poset \(\mathcal{J}(\mathbb{N}_\bot)\) of Subsection 3.6.4). In the present chapter, we show that SF can also be extended in a very different direction to yield another class SR of ‘computable’ functionals which is in some sense incompatible with PC. This class was first identified by Bucciarelli and Ehrhard [45] as the class of strongly stable functionals; later work by Ehrhard [69], van Oosten [294] and Longley [176] established the computational significance of these functionals, investigated their theory in some detail, and provided a range of alternative characterizations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Longley, J., Normann, D. (2015). The Sequentially Realizable Functionals. In: Higher-Order Computability. Theory and Applications of Computability. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47992-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-662-47992-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47991-9
Online ISBN: 978-3-662-47992-6
eBook Packages: Computer ScienceComputer Science (R0)