Results 1 - 2 of 2
"... www.math.uwaterloo.ca/˜csima ..."(Show Context)
|Venue:||Journal of Symbolic Logic|
...computable/non-computable to an order on the non-computable sets, <st gives an order on the dominant sets. However, <st is not the only obvious choice for extending the idea of domination. In  and =-=-=-, the following strong settling time domination was introduced. Definition 5. For c.e. sets A and B we say A strongly settling time dominates B, A >sst B, if for all computable functions f and g, for ...
Developed at and hosted by The College of Information Sciences and Technology
© 2007-2015 The Pennsylvania State University