Theory of Computation20815 marksUndecidable Problems
What is undecidable problem? Discuss about Post Correspondence Problem.
What is undecidable problem? Discuss about Post Correspondence Problem. [5]
--- A problem is undecidable if there is no Turing machine which will always halt in a finite amount of time to give an answer as 'yes' or 'no'. An undecidable problem has no algorithm to determine the answer for a given input. More formally, an undecidable problem is a decision problem for which...