Content deleted Content added
→Critique/Suggestions To Improve the Article: a possible example of a "Peano" register-machine for the computer science types |
→Critique/Suggestions To Improve the Article: sign for unsigned |
||
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)
== Critique/Suggestions To Improve the Article ==
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. 14:39, 9 May 2008 {{unsigned|Org322001}}
The simple one-accumulator [[register machine]] might offer a (non-strict) example of the five axioms. In this example the axioms boil down into a few primitive machine operations:
| |||