Revision as of 00:00, 29 February 2024 edit Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Use in first-order Peano arithmetic: redundant ← Previous edit		Revision as of 00:04, 29 February 2024 edit undo Janburse (talk \| contribs) Extended confirmed users 1,136 edits →Elimination of parameters Next edit →
Line 232: * #G: If φ satisfies the equation: :: φ(y,'''x''') = χ(y, COURSE-φ(y; x<sub>2</sub>, ... x<sub>n</sub> ), x<sub>2</sub>, ... x<sub>n</sub> then φ is primitive recursive in χ. The value COURSE-φ(y; '''x'''<sub>2 to n</sub> ) of the course-of-values function encodes the sequence of values φ(0,'''x'''<sub>2 to n</sub>), ..., φ(y-1,'''x'''<sub>2 to n</sub>) of the original function. ~~== Elimination of parameters ==~~ {{expert needed\|computer science\|section\|reason=properly explain the purpose of removing parameters (the text only explains how it is used, not what for - I guess in some Gödelian (un)computability proof)\|date=November 2021}} == Relationship to recursive functions ==

Primitive recursive function: Difference between revisions