Turing-Acceptability

Let be some alphabet. A TM M accepts a string iff M halts on input u. A TM M accepts a language iff . A language is Turing-acceptable iff there is some TM that accepts it.