Show simple item record

dc.contributor.authorLoo, Clinton
dc.date.accessioned2010-04-28 14:45:39 (GMT)
dc.date.available2010-04-28 14:45:39 (GMT)
dc.date.issued2010-04-28T14:45:39Z
dc.date.submitted2010-04-26
dc.identifier.urihttp://hdl.handle.net/10012/5101
dc.description.abstractIt 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}$.en
dc.language.isoenen
dc.publisherUniversity of Waterlooen
dc.subjectcomputability theoryen
dc.subjectsettling timeen
dc.subjectcomputation timeen
dc.titleSettling Time Reducibility Orderingsen
dc.typeMaster Thesisen
dc.pendingfalseen
dc.subject.programPure Mathematicsen
uws-etd.degree.departmentPure Mathematicsen
uws-etd.degreeMaster of Mathematicsen
uws.typeOfResourceTexten
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record


UWSpace

University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages