Equivalence is in the Eye of the Beholder
Theoretical Computer Science
In a recent provocative paper, Lamport points out “the insubstantiality of processess” by proving the equivalence of two different decompositions of the same intuitive algorithm by means of temporal formulas. We point out that the correct equivalence of algorithms is itself in the eye of the beholder. We discuss a number of related issues and, in particular, whether algorithms can be proved equivalent directly.
© 1997-Elsevier Science B.V. All rights reserved
Huggins, James and Guravich, Yuri, "Equivalence is in the Eye of the Beholder" (1997). Computer Science Publications. 9.