The settling-time reducibility ordering.

*(English)*Zbl 1127.03035Authors’ abstract: To each computably enumerable (c.e.) set \(A\) with a particular enumeration \(\{A_s\}_{s\in\omega}\), there is associated a settling function \(m_A(x)\), where \(m_A(x)\) is the last stage when a number less than or equal to \(x\) was enumerated into \(A\). One c.e. set \(A\) is settling-time dominated by another set \(B\) (\(B>_{\text{st}} A\)) if for every computable function \(f\), for all but finitely many \(x\), \(m_B(x) > f(m_A(x))\). This settling-time ordering, which is a natural extension to an ordering of the idea of domination, was first introduced by A. Nabutovsky and S. Weinberger [Geom. Dedicata 101, 1–54 (2003; Zbl 1039.58009)] and R. I. Soare [Bull. Symb. Log. 10, No. 4, 457–486 (2004; Zbl 1085.03033)]. They desired a sequence of sets descending in this relationship to give results in differential geometry. In this paper we examine properties of the \(<_{\text{st}}\) ordering. 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 computable \(f\) and \(g\), for almost all \(x\), \(m_b(x)> f(m_A(g(x)))\).

Reviewer: Qian Lei (Nashville)

##### MSC:

03D25 | Recursively (computably) enumerable sets and degrees |

##### References:

[1] | Computers, rigidity and moduli. The large scale fractal geometry of Reimannian moduli space (2005) |

[2] | DOI: 10.2178/bsl/1102083758 · Zbl 1085.03033 · doi:10.2178/bsl/1102083758 |

[3] | Recursively enumerable sets and degrees: A study of computable functions and computably generated sets (1987) · Zbl 0667.03030 |

[4] | Computability theory and applications · Zbl 0783.68002 |

[5] | DOI: 10.1023/A:1026358815492 · Zbl 1039.58009 · doi:10.1023/A:1026358815492 |

[6] | Computability results used in differential geometry 71 pp 1394– (2006) · Zbl 1109.03035 |

[7] | Theory of recursive functions and effective computability (1967) · Zbl 0183.01401 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.