On May 6, 3:10 pm, Andy Fingerhut <andy.finger...@gmail.com> wrote: > Caveat: The following fact may already be well known to those discussing this > issue, and I may not be clear on the goal of this effort. > > If the goal is to have functions compare as equal whenever they are > equivalent in some sense, then that is an undecidable problem, even if the > two functions are restricted to pure functions with no side effects and > closed over no vars. The proof is nearly the same as that for the halting > problem. > > Of course, it is still decidable to get the correct answer for some > restricted kinds of functions. If that is what you are after, go for it.
I don't think anyone expects quick sort to compare equal to bubble sort or anything like that. I think the issue is to get two functions with the same textual representation to compare equal. Adam -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
