Talk:Effectively separable

Changed meaning
I appears to me that User talk:CMummert's edits on 9 November 2006 changed the meaning of the term "effectively separable" completely. JRSpriggs 07:38, 10 November 2006 (UTC)


 * I didn't change the meaning of the term; I changed the article to describe a different meaning. I had never heard of the previous sense of the word, namely
 * In computability theory, a recursively enumerable class of partial recursive functions (indexed by a numbering) is effectively separable if there is an effective procedure (recursive function which is total on that class of indices) that, given two indices i and j, computes an upper bound on the least argument at which two functions with those indices converge to different values.
 * If that definition is also commonly used, it deserves to be in the article as well (who says there can only be one?). I know that the definition that is currently in the article is commonly used (google "effectively inseparable").  I'd be glad to add the second definition myself if someone will provide references for it; since I have never heard of the other definition I don't know where to look it up. CMummert 13:13, 10 November 2006 (UTC)