Talk:Primitive recursive function: Difference between revisions

Revision as of 14:34, 9 May 2008

Revision as of 14:35, 9 May 2008

Line 78:

:Sorry, but this is a difficult concept. The definition is in the first section after the lead. However, I could over-simplify it by saying that primitive recursive functions are those which can be calculated within a predetermined number of steps (which depends on inputs). [[User:JRSpriggs|JRSpriggs]] ([[User talk:JRSpriggs|talk]]) 03:35, 26 November 2007 (UTC)

:This article lacks concise and comprehensive definitions of what it is trying to describe. Declaring relationships or

Declaring relationships or information that may be relevant to a topic without precisely defining that topic leads to the obfuscation of and abandonment of concise definition.
If you feel that the material is a difficult concept, then please abandon the approach of providing strict declarative knowledge, which really says nothing precisely about a topic at all, only relationships relevant to that topic.
Since this particular topic is of interest to computer scientists, a strictly mathematical approach is of good use but not sufficient. I look forward to seeing an updated page.