A type of formal language defined as the set of all possible strings that a Turing machine can produce.