PreprintCC BY 4.0arXiv
Almost-everywhere computation of weak generics relative to r.e. sets
Abstract
A set B is AEWG if almost every set computes a weakly 1-B-generic. Extending two results of Hirschfeldt, Jockusch and Schupp, we prove that there is an AEWG superhigh r.e. set and every low2 r.e. set is AEWG.
Related
- 1-genericity and almost everywhere domination
- The Minimum Number of Measurements for Almost-Everywhere Complex Phase Retrieval
- Almost everywhere convergence of mock Fourier series for the middle-fourth Cantor measure
- Computation of leading coefficients in asymptotics of relative quantum invariants
- Weak Polynomial Completeness Does Not Imply Almost Polynomial Completeness
BibTeX
@misc{zhao2026almosteverywhere,
title = {{Almost-everywhere computation of weak generics relative to r.e. sets}},
author = {Xuanheng Zhao},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.17994},
eprint = {2609.17994},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.17994},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Almost-everywhere computation of weak generics relative to r.e. sets
AU - Xuanheng Zhao
PY - 2026
DA - 2026/09/16
PB - arXiv
DO - 10.48550/arxiv.2609.17994
UR - https://arxiv.org/abs/2609.17994
AB - A set B is AEWG if almost every set computes a weakly 1-B-generic. Extending two results of Hirschfeldt, Jockusch and Schupp, we prove that there is an AEWG superhigh r.e. set and every low2 r.e. set is AEWG.
ER -