Content deleted Content added
No edit summary |
→Circularity of Definitions: good catch |
||
Line 34:
A countable set S is called recursively enumerable if there exists a partial computable function <math>f : \mathbb{N} \to S</math> such that <math>S</math> is the range of <math>f</math>?
--[[User:Ashsong|Michael Stone]] 00:25, 11 March 2006 (UTC)
:Good catch. The definitions in [[computable function]] should be reworked, and probably [[computable function]] and [[recursive function]] should be merged. --[[User:Trovatore|Trovatore]] 00:41, 11 March 2006 (UTC)
| |||