4 Characterising Turing-incomplete Martin-L¨ of random sets

Then there is an optimal convex recoloring such that for each bad color c, all vertices that receive color c have color c in the original coloring or are gluing for c or are