In theory of computation, a problem that cannot be decided by algorithmic means even after giving an unlimited resource and an infinite amount of time is termed as undecidable. We’ll explore more topics like Decidability and Undecidability, Universal Turing Machine, Halting, and Post Correspondence Problem.
