Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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.

share|improve this question

closed as not a real question by William, tomasz, Chris Eagle, rschwieb, t.b. Sep 14 '12 at 17:48

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.If this question can be reworded to fit the rules in the help center, please edit the question.

What definition of "closed form" are you using? –  J. M. 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