Showing 2017Show all
2 papers · 1 filter
math.LO2017
Covering the recursive sets
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
We give solutions to two of the questions in a paper by Brendle, Brooke-Taylor, Ng and Nies. Our examples derive from a 2014 construction by Khan and Miller as well as new direct c…
math.LO2017
Closure of resource-bounded randomness notions under polynomial time permutations
Andre Nies, Frank Stephan
An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive ra…