Some Intensional Models

In the preceding chapters, broadly speaking, we have been working our way gradually from ‘weaker’ to ‘stronger’ notions of computability (see the diagram on page 33). This has culminated in Chapters 10 and 11 with the study of the two type structures PC and SR that represent maximal notions of compu...

Full description

Saved in:
Bibliographic Details
Published inHigher-Order Computability pp. 505 - 534
Main Authors Longley, John, Normann, Dag
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2015
SeriesTheory and Applications of Computability
Subjects
Applicative Simulation
Game Model
Operational Semantic
Partial Function
Sequential Algorithm
Online AccessGet full text
ISBN3662479915
9783662479919
ISSN2190-619X
2190-6203
DOI10.1007/978-3-662-47992-6_12

Cover

More Information
Summary:In the preceding chapters, broadly speaking, we have been working our way gradually from ‘weaker’ to ‘stronger’ notions of computability (see the diagram on page 33). This has culminated in Chapters 10 and 11 with the study of the two type structures PC and SR that represent maximal notions of computable functional subject to certain constraints (Theorems 10.5.7 and 11.3.3).
ISBN:3662479915
9783662479919
ISSN:2190-619X
2190-6203
DOI:10.1007/978-3-662-47992-6_12