Investigating Structure in Turing Categories
The concept of a computable function is quite a well-studied one, however, it is possible to capture certain important properties of computability categorically. A special type of category used for this purpose is called a Turing category. This thesis starts with a brief overview of Turing categorie...
Main Author: | |
---|---|
Other Authors: | |
Language: | en |
Published: |
Université d'Ottawa / University of Ottawa
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10393/20505 http://dx.doi.org/10.20381/ruor-5119 |
id |
ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-20505 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-uottawa.ca-oai-ruor.uottawa.ca-10393-205052018-01-05T19:01:08Z Investigating Structure in Turing Categories Vinogradova, Polina Hofstra, Pieter Turing category Computable function The concept of a computable function is quite a well-studied one, however, it is possible to capture certain important properties of computability categorically. A special type of category used for this purpose is called a Turing category. This thesis starts with a brief overview of Turing categories, followed by a study of additional categorical structure they may contain, based on the types of structure found in the world of computable functions, and how this is reflected in the underlying combinatorial structures. 2012-01-05T20:45:09Z 2012-01-05T20:45:09Z 2012 2012 Thesis http://hdl.handle.net/10393/20505 http://dx.doi.org/10.20381/ruor-5119 en Université d'Ottawa / University of Ottawa |
collection |
NDLTD |
language |
en |
sources |
NDLTD |
topic |
Turing category Computable function |
spellingShingle |
Turing category Computable function Vinogradova, Polina Investigating Structure in Turing Categories |
description |
The concept of a computable function is quite a well-studied one, however, it is possible to capture certain important properties of computability categorically. A special type of category used for this purpose is called a Turing category. This thesis starts with a brief overview of Turing categories, followed by a study of additional categorical structure they may contain, based on the types of structure found in the world of computable functions, and how this is reflected in the underlying combinatorial structures. |
author2 |
Hofstra, Pieter |
author_facet |
Hofstra, Pieter Vinogradova, Polina |
author |
Vinogradova, Polina |
author_sort |
Vinogradova, Polina |
title |
Investigating Structure in Turing Categories |
title_short |
Investigating Structure in Turing Categories |
title_full |
Investigating Structure in Turing Categories |
title_fullStr |
Investigating Structure in Turing Categories |
title_full_unstemmed |
Investigating Structure in Turing Categories |
title_sort |
investigating structure in turing categories |
publisher |
Université d'Ottawa / University of Ottawa |
publishDate |
2012 |
url |
http://hdl.handle.net/10393/20505 http://dx.doi.org/10.20381/ruor-5119 |
work_keys_str_mv |
AT vinogradovapolina investigatingstructureinturingcategories |
_version_ |
1718597432678285312 |