My understanding of Recursively Enumerable Functions is that they're recursive functions, but for some values of the arguments you put into the function they will stop and give an answer, and for others, they will go on forever and they will never ever stop.

What are some easy-to-understand examples of Recursively Enumerable Functions?

  • $\begingroup$ Recursively enumerable languages are recognizable languages. The wording is a bit confusing - so it doesn't literally mean "recursive". The same goes with functions. $\endgroup$
    – nir shahar
    Jan 12 at 22:44
  • $\begingroup$ Any written computer function is recursively enumerable. $\endgroup$
    – nir shahar
    Jan 12 at 22:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.