Perhaps the most famous open problem in algorithmic randomness [1]}, [2]} is whether Kolmogorov–Loveland randomness is equal to Martin-Löf randomness.
Here we show that at least they are Medvedev equivalent.
