engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following is/are true among the below given statements?
1
L = { e(T) | e(T) ϵ L(T), where e(T) is binary encoding of T and L(T) is language accepted by T } is Recursive Enumerable but not Recursive
2
L = { T | T is a machine which rejects its own coding } is Recursive Enumerable
3
Post correspondence problem (PCP) is Undecidable
4
“Is the complement of a Recursive Enumerable language is also a Recursive Enumerable” is decidable problem