
arXiv: 1410.1986
AbstractWe construct a speedable set that cannot be split into speedable sets. This solves a question of Bäuerle and Remmel.
Complexity of computation (including implicit computational complexity), Recursively (computably) enumerable sets and degrees, speedable sets, FOS: Mathematics, splittings, Mathematics - Logic, Logic (math.LO)
Complexity of computation (including implicit computational complexity), Recursively (computably) enumerable sets and degrees, speedable sets, FOS: Mathematics, splittings, Mathematics - Logic, Logic (math.LO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
