Halting problem asks: “Is it possible for a computer program to check whether a program is entering an infinite loop?” This question is recursively undecidable in the sense that such program is not possible to check itself.
Halting problem asks: “Is it possible for a computer program to check whether a program is entering an infinite loop?” This question is recursively undecidable in the sense that such program is not possible to check itself.