Back to results

University of Connecticut

Computable Linear Orders and Turing Reductions

Abstract

dc:description.abstract

<p>This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations.</p>

Degree

thesis:*
Name thesis:degree_name
Master of Science
Discipline thesis:degree_discipline
Mathematics
Year dc:date.available
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Turner, Whitney P
Contributors dc:contributor
  • Johanna N.Y. Franklin; Henry Towsner
  • David Reed Solomon

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.lib.uconn.edu/gs_theses/246
OAI identifier oai:identifier
oai:digitalcommons.lib.uconn.edu:gs_theses-1288

Chain of custody

source
Harvested from
University of Connecticut
Base URL
digitalcommons.lib.uconn.edu/do/oai/
Last updated
2026-07-24
Source record
OAI-PMH GetRecord
citation

Turner, Whitney P. Computable Linear Orders and Turing Reductions. 2012. https://digitalcommons.lib.uconn.edu/gs_theses/246