Revision as of 19:28, 8 August 2008 edit Wanderer57 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 4,886 edits →Dumb Questions: further ← Previous edit		Revision as of 19:46, 8 August 2008 edit undo CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits →Dumb Questions: re Next edit →
Line 105: ::::Thanks. Can you suggest a program that witnesses that the set of natural numbers that are multiples of 7 are r.e., because the ___domain of the function is that set? [[User:Wanderer57\|Wanderer57]] ([[User talk:Wanderer57\|talk]]) 19:28, 8 August 2008 (UTC) :::::Trovatore's original function witnesses that. If the input is a multiple of 7, the program halts. Otherwise, it does not halt. So the ___domain (set of values for which it halts) is exactly the set of multiples of 7. This is a [[partial function]]. :::::The term "co-range" is not used in recursion theory; it's a category-theory term. I think it was added here in an attempt to clarify for category theorists which meaning of "___domain" is intended. See [[___domain (mathematics)]] — Carl <small>([[User:CBM\|CBM]] · [[User talk:CBM\|talk]])</small> 19:46, 8 August 2008 (UTC)

Talk:Computably enumerable set: Difference between revisions