The Complexity of Recursive Splittings of Random Sets
Keng Meng Ng, André Nies, Frank Stephan · Computability · 2014
It is investigated how much information of a random set can be preserved if one splits the random set into two halves or, more generally, cuts out an infinite portion with an infinite recursive set. The two main results are the following ones: 1. Eve