Total maps of Turing categories
From MaRDI portal
Recommendations
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)