Question: Use diagonalization to argue that the language = {#| }(the set of all turing machine, input pair (M,x) such that turing machine M loops forever
Use diagonalization to argue that the language = {#| }(the set of all turing machine, input pair (M,x) such that turing machine M loops forever on input x) is 2 undecidable, further argue that is not even semi-decidable. You are not supposed to rely on any theories unless being backed up with proper proofs.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
