Nullifying randomness and genericity using symmetric difference

For a class C of sets, let us say that a set A is C stabilising if A△X∈C for every X∈C. We prove that the Martin-Löf stabilising sets are exactly the K-trivial sets, as are the weakly 2-random stabilising sets. We also show that the 1-generic stabilising sets are exactly the computable sets.