Total maps of Turing categories

DOI10.1016/j.entcs.2014.10.008zbMath1337.03057OpenAlexW2152147989WikidataQ113317847 ScholiaQ113317847MaRDI QIDQ283751

J. Robin B. Cockett, Pieter J. W. 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

computability theorycomplexity theorypartial combinatory algebraTuring category

Mathematics Subject Classification ID

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

Related Items (3)

Categorical semantics of a simple differential programming language ⋮ Formalizing abstract computability: Turing categories in Coq ⋮ Aspects of Categorical Recursion Theory

Cites Work

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

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