Let
$L=\{ \langle M \rangle \mid M \text{ is a Turing Machine which halts on all inputs}\}$.
Is this a Turing-recognizable language? I guess that it is neither Turing-recognizable, nor co-Turing-recognizable, but I can't prove it.
Asked
Active
Viewed 150 times
