Theory of Computation - Old Questions
14. Explain the term Turing acceptable and Turing decidable. Show that if L is recursive language then complement of L is also recursive.
8 marks
|
Asked in 2075