|more useful options|
Re^2: Equivalency of Codeby ambrus (Abbot)
|on Feb 07, 2005 at 10:26 UTC||Need Help??|
In the general case though, proving the functional identity of two pieces of code is equivalent to solving the halting problem, and thus infeasible (I think).
Indeed. If same($code1, $code2) could find out whether the $code1 and $code2 functions behave identically, then
would be a contradiction.