Investigating Structure in Turing Categories
| dc.contributor.author | Vinogradova, Polina | |
| dc.contributor.supervisor | Hofstra, Pieter | |
| dc.date.accessioned | 2012-01-05T20:45:09Z | |
| dc.date.available | 2012-01-05T20:45:09Z | |
| dc.date.created | 2012 | |
| dc.date.issued | 2012 | |
| dc.degree.discipline | Sciences / Science | |
| dc.degree.level | masters | |
| dc.degree.name | MSc | |
| dc.description.abstract | 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. | |
| dc.embargo.terms | immediate | |
| dc.faculty.department | Mathématiques et statistique / Mathematics and Statistics | |
| dc.identifier.uri | http://hdl.handle.net/10393/20505 | |
| dc.identifier.uri | http://dx.doi.org/10.20381/ruor-5119 | |
| dc.language.iso | en | |
| dc.publisher | Université d'Ottawa / University of Ottawa | |
| dc.subject | Turing category | |
| dc.subject | Computable function | |
| dc.title | Investigating Structure in Turing Categories | |
| dc.type | Thesis | |
| thesis.degree.discipline | Sciences / Science | |
| thesis.degree.level | Masters | |
| thesis.degree.name | MSc | |
| uottawa.department | Mathématiques et statistique / Mathematics and Statistics |
