Back to search

University of Waterloo

Settling Time Reducibility Orderings

Abstract

dc:description.abstract

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 time domination as a relation on $n$-c.e. sets where $n \geq 3$. This will be extended to the case of $2$-c.e. sets, showing that no ordering can be derived from computation time domination on $n$-c.e. sets when $n\geq 2$. Additionally, we will observe properties of the orderings given by settling time domination and strong settling time domination on c.e. sets, respectively denoted as \mathcal{E}st and \mathcal{E}sst. More specifically, it is already known that any countable partial ordering can be embedded into \mathcal{E}st and any linear ordering with no infinite ascending chains can be embedded into \mathcal{E}sst. Continuing along this line, we will show that any finite partial ordering can be embedded into \mathcal{E}sst.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2010

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Loo, Clinton

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/5101

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Loo, Clinton. Settling Time Reducibility Orderings. University of Waterloo, 2010. http://hdl.handle.net/10012/5101