in reply to Re: Equivalency of Code
in thread Equivalency of Code
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.sub f1 { "different"; } sub f2 { same(\&f1, \&f2) ? "same" : "different"; } f2();
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^3: Equivalency of Code
by bunnyman (Hermit) on Feb 07, 2005 at 16:09 UTC | |
by dynamo (Chaplain) on Feb 07, 2005 at 22:29 UTC | |
by bunnyman (Hermit) on Feb 08, 2005 at 16:58 UTC | |
Re^3: Equivalency of Code
by adamk (Chaplain) on Feb 08, 2005 at 03:05 UTC | |
Re^3: Equivalency of Code
by dragonchild (Archbishop) on Feb 07, 2005 at 17:08 UTC | |
by Boots111 (Hermit) on Feb 08, 2005 at 03:48 UTC |
In Section
Seekers of Perl Wisdom