Settling Time Reducibility Orderings
| dc.contributor.author | Loo, Clinton | |
| dc.date.accessioned | 2010-04-28T14:45:39Z | |
| dc.date.available | 2010-04-28T14:45:39Z | |
| dc.date.issued | 2010-04-28T14:45:39Z | |
| dc.date.submitted | 2010-04-26 | |
| 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}$. | en |
| dc.identifier.uri | http://hdl.handle.net/10012/5101 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.subject | computability theory | en |
| dc.subject | settling time | en |
| dc.subject | computation time | en |
| dc.subject.program | Pure Mathematics | en |
| dc.title | Settling Time Reducibility Orderings | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Pure Mathematics | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |