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.
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.