Timeline for Teaching suggestions for Kleene fixed point theorem
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 27 at 13:10 | comment | added | Joel David Hamkins | Vote up this comment if I should leave the answer posted. | |
| Mar 27 at 13:10 | comment | added | Joel David Hamkins | Vote up this comment if I should delete this answer. | |
| Mar 27 at 13:08 | history | edited | Joel David Hamkins | CC BY-SA 4.0 |
added 477 characters in body
|
| Mar 27 at 13:06 | comment | added | Joel David Hamkins | Oh dear! What I call the Kleene recursion theorem is about fixed points of computability: for any computable function $f$ there is a program $e$ such that $e$ and $f(e)$ compute the same function. I have edited with a remark. | |
| Mar 27 at 13:04 | comment | added | Gro-Tsen | I was about to make similar suggestions, but I realized that OP is talking about Kleene's fixed-point theorem for continuous functions on directed-complete partial order, whereas your answer is about Kleene's recursion theorem. (But maybe there's a smart way to see the latter as a corollary of the former.) | |
| Mar 27 at 13:04 | history | edited | Joel David Hamkins | CC BY-SA 4.0 |
added 1262 characters in body
|
| Mar 27 at 12:50 | history | edited | Joel David Hamkins | CC BY-SA 4.0 |
added 1262 characters in body
|
| Mar 27 at 12:39 | history | answered | Joel David Hamkins | CC BY-SA 4.0 |