When are two algorithms the same?

11/05/2008
by   Andreas Blass, et al.
0

People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/11/2019

Equivalence classes of Niho bent functions

Equivalence classes of Niho bent functions are described for all known t...
research
03/10/2018

Efficient Determination of Equivalence for Encrypted Data

Secure computation of equivalence has fundamental application in many di...
research
11/25/2020

Learnability and Positive Equivalence Relations

Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated wh...
research
07/17/2019

Defining Functions on Equivalence Classes

A quotient construction defines an abstract type from a concrete type, u...
research
08/25/2019

Proximity-based equivalence classes in fuzzy relational database model

One of the first attempts to set a solid theoretical foundation for exte...
research
02/17/2020

Equivalence of Dataflow Graphs via Rewrite Rules Using a Graph-to-Sequence Neural Model

In this work we target the problem of provably computing the equivalence...
research
06/22/2019

Strong Bisimulation for Control Operators

The purpose of this paper is to identify programs with control operators...

Please sign up or login with your details

Forgot password? Click here to reset