Computability models over categories
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TFJE6N7Drecord.jsonopen to challenge →
read the original abstract
Generalising slightly the notions of a strict computability model and of a simulation between them, which were elaborated by Longley and Normann, we define canonical computability models over categories and appropriate Set-valued functors on them. We study the canonical total computability model over a category, and the partial one over a category with pullbacks. Our notions and results are generalised to categories with a base of computability, connecting Rosolini's theory of dominions with the theory of computability models.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.