Now showing items 1-1 of 1
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 ...