Investigating Structure in Turing Categories

FieldValue
dc.contributor.authorVinogradova, Polina
dc.date.accessioned2012-01-05T20:45:09Z
dc.date.available2012-01-05T20:45:09Z
dc.date.created2012
dc.date.issued2012
dc.identifier.urihttp://hdl.handle.net/10393/20505
dc.identifier.urihttp://dx.doi.org/10.20381/ruor-5119
dc.description.abstractThe 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.language.isoen
dc.publisherUniversité d'Ottawa / University of Ottawa
dc.subjectTuring category
dc.subjectComputable function
dc.titleInvestigating Structure in Turing Categories
dc.typeThesis
dc.faculty.departmentMathématiques et statistique / Mathematics and Statistics
dc.contributor.supervisorHofstra, Pieter
dc.embargo.termsimmediate
dc.degree.nameMSc
dc.degree.levelmasters
dc.degree.disciplineSciences / Science
thesis.degree.nameMSc
thesis.degree.levelMasters
thesis.degree.disciplineSciences / Science
uottawa.departmentMathématiques et statistique / Mathematics and Statistics
CollectionThèses, 2011 - // Theses, 2011 -

Files