Equivalence is in the Eye of the Beholder

TL;DR

This paper challenges the notion of algorithmic equivalence by arguing that what is considered equivalent depends on perspective, and explores the complexities of proving such equivalences directly.

Contribution

It introduces a perspective-dependent view of algorithmic equivalence and discusses the challenges in proving equivalence directly rather than through formulas.

Findings

Equivalence of algorithms is subjective and perspective-dependent.

Proving algorithmic equivalence directly is complex and not always feasible.

The paper questions the universality of formal equivalence proofs.

Abstract

In a recent provocative paper, Lamport points out "the insubstantiality of processes" 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.