A #concept in #ComputerScience
An undecidable problem in Computer Science, is a problem that it is known that no algorithm exists that can solve it for all instances.
Formally, this means there can’t exist a Turing machine that, for every instance of the problem, it halts after a finite number of steps and produces the correct result. Thus, undecidable problems can have procedures but not algorithms to solve them.
The most famous undecidable problem in Computer Science is the halting problem.
Rice’s theorem provides a source of infinite undecidable problems.