Consider a program named COMP that takes two strings as input. It returns TRUE if the strings

Question:

Consider a program named COMP that takes two strings as input. It returns TRUE if the strings are the same. It returns FALSE if the strings are different. Why doesn't the argument that we used to prove that a program to solve the halting problem does not exist work to prove that COMP does not exist?

Fantastic news! We've Found the answer you've been seeking!