Author:
Csima Barbara F.,Shore Richard A.
Abstract
AbstractTo each computable enumerable (c.e.) setAwith a particular enumeration {As}s∈ωthere is associated a settling functionmA(x), wheremA(x) is the last stage when a number less than or equal toxwas enumerated intoA. One c.e. setAis settling time dominated by another setB(B>stA) if for every computable functionf, for all but finitely manyx, mB(x) >f(mA(x)). This settling-time ordering, which is a natural extension to an ordering of the idea of domination, was first introduced by Nabutovsky and Weinberger in [3] and Soare [6]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the <stordering. We show that it is not invariant under computable isomorphism, that any countable partial ordering embeds into it. that there are maximal and minimal sets, and that two c.e. sets need not have an inf or sup in the ordering. We also examine a related ordering, the strong settling-time ordering where we require for all computablefandg, for almost allx, mB(x) >f(mA(g(x))).
Publisher
Cambridge University Press (CUP)
Reference8 articles.
1. Computability Theory and Differential Geometry
2. Csima B. F. , Applications of computability theory to prime models and differential geometry, Ph.D. thesis, The University of Chicago, 2003.
3. Computers, Rigidity, and Moduli
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. ON A QUESTION OF CSIMA ON COMPUTATION-TIME DOMINATION;Proceedings of the 12th Asian Logic Conference;2013-05-28
2. Algorithmic Randomness and Complexity;Theory and Applications of Computability;2010