Formalizing Abstract Computability: Turing Categories in Coq
The concept of a recursive function has been extensively studied using traditional tools of computability theory. However, with the development of category-theoretic methods it has become possible to study recursion in a more general (abstract) sense. The particular model this thesis is structured a...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en |
| Published: |
Université d'Ottawa / University of Ottawa
2017
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/36354 http://dx.doi.org/10.20381/ruor-20634 |