True. For a recursive language, we have a TM which says for any string "w", "yes" if it belongs to the language and "no" if it does not. For the complement of a recursive language we just have to reverses 'yes' and 'no' conditions and this is possible with a slight modification to the original TM.