Semi-Deciduous Turing Machine for L = {a, b} *

I have a language L = {a, b} * on the alphabet {a, b}.

How can I build a Turing machine that semi-decides but does not decide that language?