Browsing Theses by Subject "computability theory"
Now showing items 1-2 of 2
-
Computability Theory and Some Applications
(University of Waterloo, 2019-07-15)We explore various areas of computability theory, ranging from applications in computable structure theory primarily focused on problems about computing isomorphisms, to a number of new results regarding the degree-theoretic ... -
Settling Time Reducibility Orderings
(University of Waterloo, 2010-04-28)It is known that orderings can be formed with settling time domination and strong settling time domination as relations on c.e. sets. However, it has been shown that no such ordering can be formed when considering computation ...