Nested Sequential Procedures

In this chapter, we study in depth the nested sequential procedure (NSP) model which we introduced briefly in Subsection 3.2.5. The point of view we shall adopt is that NSPs offer an abstract formulation of an underlying concept of ‘algorithm’ that is common to both Kleene computability (as studied...

Full description

Saved in:
Bibliographic Details
Published inHigher-Order Computability pp. 211 - 278
Main Authors Longley, John, Normann, Dag
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2015
SeriesTheory and Applications of Computability
Subjects
Induction Hypothesis
Left Branch
Partial Model
Sequential Procedure
Syntax Tree
Online AccessGet full text
ISBN3662479915
9783662479919
ISSN2190-619X
2190-6203
DOI10.1007/978-3-662-47992-6_6

Cover

More Information
Summary:In this chapter, we study in depth the nested sequential procedure (NSP) model which we introduced briefly in Subsection 3.2.5. The point of view we shall adopt is that NSPs offer an abstract formulation of an underlying concept of ‘algorithm’ that is common to both Kleene computability (as studied in the previous chapter) and Plotkin’s PCF (the subject of the next chapter). We shall consider NSPs both as forming a self-contained model of computation in their own right, and as a calculus of algorithms that can be interpreted in many other (total and partial) models.
ISBN:3662479915
9783662479919
ISSN:2190-619X
2190-6203
DOI:10.1007/978-3-662-47992-6_6