I was wondering if this is true. I already proved that it is true for regular languages and I assume it is similar in context free languages (correct me if I am wrong), but what about languages in R that are not context-free?
For every two decidable languages There is a turing machine that decides if they are equal
computability;turing machines;context free;undecidability