 There is no algorithm that takes as input any two lambda expressions and outputs TRUE or FALSE depending on whether or not the two expressions are equivalent.More precisely, no computable function can decide the equivalence.This was historically the first problem for which undecidability could be proven.