Timeline for Decomposition of the set of computable functions into base functions
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 26, 2015 at 21:37 | vote | accept | Stefan Lutz | ||
| Feb 25, 2015 at 16:00 | history | edited | David Durrleman | CC BY-SA 3.0 |
added 47 characters in body
|
| Feb 25, 2015 at 13:46 | comment | added | David Durrleman | I edited my answer to make the process of embedding Unlambda programs into functions from and to natural numbers clearer. | |
| Feb 25, 2015 at 13:46 | history | edited | David Durrleman | CC BY-SA 3.0 |
added 2369 characters in body
|
| Feb 24, 2015 at 10:48 | comment | added | Stefan Lutz | Thank you for the detailed answer! What I don't understand yet, however, is how s and k could be written as a "normal" function from and to natural numbers, without relying on the given operational semantics? For example, what does xz(yz) "mean" in basic mathematical terms? | |
| Feb 24, 2015 at 0:19 | history | edited | David Durrleman | CC BY-SA 3.0 |
deleted 41 characters in body
|
| Feb 23, 2015 at 23:41 | history | edited | David Durrleman | CC BY-SA 3.0 |
added 478 characters in body
|
| Feb 23, 2015 at 23:15 | history | edited | David Durrleman | CC BY-SA 3.0 |
added 626 characters in body
|
| Feb 23, 2015 at 23:03 | history | answered | David Durrleman | CC BY-SA 3.0 |