<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T19:57:36Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5101" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5101</identifier><datestamp>2017-03-21T13:51:00Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9932</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="35b9e643-8550-43c5-b924-e59229d8a095" confidence="600">Loo, Clinton</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-04-28T14:45:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-04-28T14:45:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-04-28T14:45:39Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010-04-26</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5101</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">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$.&#xd;
&#xd;
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}$.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">computability theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">settling time</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">computation time</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Pure Mathematics</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Settling Time Reducibility Orderings</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Pure Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>