Non-splittings of speedable sets
Logic
2014-10-09 v1
Abstract
An r.e. set is speedable if for every recursive function, there exists a program enumerating membership in faster, by the desired recursive factor, on infinitely many integers. We construct a speedable set that cannot be split into speedable sets. This solves a question of B\"{a}uerle and Remmel.
Keywords
Cite
@article{arxiv.1410.1986,
title = {Non-splittings of speedable sets},
author = {Ellen Chih},
journal= {arXiv preprint arXiv:1410.1986},
year = {2014}
}