# Recursion closed form [closed]

Is there a theorem stating that all recursive problems cannot have a closed form? Or the other way around, stating that all recursive problems can have a closed form.

-
What definition of "closed form" are you using? –  Ｊ. Ｍ. Dec 30 '11 at 5:31
I think what makes things hard to prove is the definition of "closed form". Very often, what we're calling "closed form" is just something satisfactory enough to work with, mostly written like "thing I want = weird but not too bad formula". –  Patrick Da Silva Dec 30 '11 at 5:57
@Sean, as written your question makes no sense. "recursive" has a very different meaning than the one I think you intended: If you were talking about recurrence relations you'll need to state that specifically. –  user16697 Dec 31 '11 at 7:18