Timeline for Show that the function that counts the number of occurrences of 6 in a natural number is recursive primitive
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 7, 2022 at 13:19 | comment | added | 喜欢算法和数学 | It may help the asker if you could describe (and prove) the exact lemma/theorem/tool that enables that "now you just need"? The definition of count6 in this answer involves recursion that is different from the primitive recursion operator in the usual definition of a primitive-recursive function. | |
| Jun 7, 2022 at 7:43 | history | edited | Gaslight Deceive Subvert | CC BY-SA 4.0 | edited body |
| Jun 7, 2022 at 7:43 | comment | added | Gaslight Deceive Subvert | I don't understand. If the lectures introduced the basic operations on primitive recursive functions then giggiox has the tools they need for showing that composite functions are primitive recursive. | |
| Jun 7, 2022 at 1:49 | comment | added | 喜欢算法和数学 | "Now you just need to show ...". Why? That could be the main part of the exercise, since "i guess we can use this strategy, the problem is that we didn't cover it in the lectures, so i guess i can't use it" | |
| Jun 6, 2022 at 21:21 | history | answered | Gaslight Deceive Subvert | CC BY-SA 4.0 |