Promptness does not imply superlow cuppability. (English) Zbl 1197.03044

The main result of this paper is the following: There is a promptly simple set that is not superlow cuppable. This result is a negative answer to the question of A. Nies.


03D25 Recursively (computably) enumerable sets and degrees
03D30 Other degrees and reducibilities in computability and recursion theory
Full Text: DOI


[1] Algorithmic randomness and complexity · Zbl 1221.68005
[2] DOI: 10.1142/S0219061307000640 · Zbl 1149.03032
[3] DOI: 10.1142/9789812796554_0004
[4] DOI: 10.1090/S0002-9947-1984-0719661-8
[5] Computability theory and applications · Zbl 0783.68002
[6] DOI: 10.2178/bsl/1154698741 · Zbl 1113.03037
[7] Computability and randomness · Zbl 0976.03052
[8] Proceedings of logic colloquium 2002 27 pp 261– (2002)
[9] DOI: 10.1016/j.aim.2004.10.006 · Zbl 1141.03017
[10] DOI: 10.1002/malq.19860320103 · Zbl 0625.03022
[11] Transactions of the American Mathematical Society 173 pp 33– (1972) · Zbl 0247.00014
[12] Recursively enumerable sets and degrees (1987)
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.