Total maps of Turing categories

DOI10.1016/J.ENTCS.2014.10.008MaRDI QIDQ283751zbMATHOpenAlexWikidataFDO

Authors J. R. B. Cockett, Pieter Hofstra, Pavel Hrubeš

Publication date 13 May 2016

Full work available at URL https://doi.org/10.1016/j.entcs.2014.10.008

zbMATH Keywords

complexity theorycomputability theorypartial combinatory algebraTuring category

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Special categories (18B99) Turing machines and related notions (03D10)

Recommendations

• Introduction to Turing categories
• scientific article; zbMATH DE number 3979049
• Timed Sets, Functional Complexity, and Computability
• ``Pathologies in two syntactic categories of partial maps
• Categorical simulations

Cites work

• Categories with finite limits and stable binary coproducts can be subdirectly decomposed
• Dominical categories: recursion theory without elements
• Introduction to Turing categories
• Logical foundations of proof complexity
• Restriction categories. I: Categories of partial maps
• Timed Sets, Functional Complexity, and Computability

Cited in

(7)

• Categorical semantics of a simple differential programming language
• Totally Categorical Structures
• scientific article; zbMATH DE number 3946099 (Why is no real title available?)
• Introduction to Turing categories
• Aspects of categorical recursion theory
• Formalizing abstract computability: Turing categories in Coq
• Categorical simulations

This page was built for publication: Total maps of Turing categories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283751)