Most of the “undecidable” are only undecidable for a subset of the problem instances, while a vast number of instances can be even trivially decidable. For example in the undecidable halting problem, both you and a computer can trivially deduce that while(true) will not halt. In the same way a computer can deduce that many instances of two pieces of code are semantically equivalent.
I’d like to see an instance of the problem where a human could decide it and the computer could not.
Most of the “undecidable” are only undecidable for a subset of the problem instances, while a vast number of instances can be even trivially decidable. For example in the undecidable halting problem, both you and a computer can trivially deduce that
while(true)will not halt. In the same way a computer can deduce that many instances of two pieces of code are semantically equivalent.I’d like to see an instance of the problem where a human could decide it and the computer could not.