Content deleted Content added
AshtonBenson (talk | contribs) |
AshtonBenson (talk | contribs) |
||
Line 140:
: Boolos Burgess Jeffrey 2002 say that "Another process, called (''primitive'') ''recursion'', is what is involved in defining multiplication as repeated addition, exponentiation as repeated multiplication, as so on." (p. 58); we can't get what we need to do arithmetic as we know it with just "zero", "successor", "identity" and "composition". Kleene 1952:217 introduces his Chapter IX "Primitive Recursive Functions" with "To establish the lemma for Goedel's theorm, we shall develop an intuitive theory about a certain class of number-theoretic functions and predicate [etc]...". Minsky implies the machines associated with PR are "not quite so complicated" [as a Turing machine] so explorations of undecidability might be easier (p. 116). That's about all I've got. Bill [[User:Wvbailey|Wvbailey]] ([[User talk:Wvbailey|talk]]) 02:02, 23 August 2009 (UTC)
:: Bill, thanks for the nice citations in which people mention PR functions, but I don't really think any of those speak to their notability (while they certainly do describe the PR functions!) [[User:AshtonBenson|AshtonBenson]] ([[User talk:AshtonBenson|talk]]) 00:59, 28 August 2009 (UTC)
| |||