# Tag Info

One could write an entire book surveying techniques of proving program equivalence. This answer is just as a very short starting point: Theoretically, if you think about your programs as Turing Machines, then all hope is lost -- proving that two TMs have the same language (i.e., they are semantically equivalent) is undecidable (in fact, it's not in RE$\cup$ ...