I am trying to figure out if L is partially decidable or not partially decidable.

Let L be {encode(x): x is a Turing machine that halts on input encode(x)}.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.