Content deleted Content added
Wanderer57 (talk | contribs) →Dumb Questions: new section |
→Dumb Questions: responses |
||
Line 91:
Thanks very much. [[User:Wanderer57|Wanderer57]] ([[User talk:Wanderer57|talk]]) 14:13, 8 August 2008 (UTC)
:# Yes, "partial recursive function" is the same as "partial computable function". Logically it should really be "recursive partial function" but this is the traditional name. They should be defined or linked.
:# I think "co-range" is kind of silly.
:# An r.e. set may be defined either as the ___domain or as the range of a partial recursive function. The two definitions are equivalent, but one may sometimes be more ocnvenient than the other.
:# Sure, there are tons of simple examples. Whether it's useful to list them is something that might want some thought....
:# Yes, the multiples of 7 form an r.e. set. Write a program that tests the input to see if it's a multiple of 7, and if so outputs 0; otherwise, it goes into an infinite loop. The partial recursive function defined by that program witnesses that the set is r.e. --[[User:Trovatore|Trovatore]] ([[User talk:Trovatore|talk]]) 18:45, 8 August 2008 (UTC)
| |||