|
Asymptotic density and computability
I. I. Batyrshin Kazan Federal University, 18 Kremlyovskaya str., Kazan, 420008 Russia
Abstract:
We show that a set is bi-immune if and only if there are no computable permutations that arrange the set into a generically computable set or an effectively densely computable set. An example of a coarsely computable bi-immune set is constructed. It is also proved that for any set there is a permutation from the same Turing degree that arranges the set into an effectively densely computable set. The upper densities of some sets are studied.
Keywords:
asymptotic density, generic complexity, bi-immune set, Turing degree.
Received: 02.11.2020 Revised: 02.11.2020 Accepted: 30.03.2021
Citation:
I. I. Batyrshin, “Asymptotic density and computability”, Izv. Vyssh. Uchebn. Zaved. Mat., 2021, no. 10, 3–14; Russian Math. (Iz. VUZ), 65:10 (2021), 1–9
Linking options:
https://www.mathnet.ru/eng/ivm9717 https://www.mathnet.ru/eng/ivm/y2021/i10/p3
|
Statistics & downloads: |
Abstract page: | 123 | Full-text PDF : | 57 | References: | 24 | First page: | 2 |
|