Recursive languages belong to a class of formal languages that can be recognized by a Turing machine.