A MINIMAL rK-DEGREE
Alexander Raichev, Frank Stephan · Lecture notes series, Institute For Mathematical Sciences · 2008
Abstract. We construct a minimal rK-degree, continuum many, in fact. We also show that every minimal sequence, that is, a sequence with minimal rK-degree, must have very low descriptional complexity, that every minimal sequence is rK-reducible to a random sequence, and that there is a random sequence with no minimal sequence rK-reducible to it. 1.