• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 4
  • 4
  • 4
  • 4
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Investigating Structure in Turing Categories

Vinogradova, Polina 05 January 2012 (has links)
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.
2

Investigating Structure in Turing Categories

Vinogradova, Polina 05 January 2012 (has links)
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.
3

Investigating Structure in Turing Categories

Vinogradova, Polina 05 January 2012 (has links)
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.
4

Investigating Structure in Turing Categories

Vinogradova, Polina January 2012 (has links)
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.

Page generated in 0.0777 seconds