Timeline for Why is automated theorem proving impossible?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 30, 2015 at 14:33 | comment | added | Jake | Correct. It's just nice and a near full treatment fits on a post. | |
| Apr 30, 2015 at 11:12 | comment | added | babou | I like this presentation which I find quite pedagogical. However, Gödel's incompleteness theorem has a minimal requirement that the theory must be able to express elementary arithmetic. Is'nt that even less than having a logic for Turing Machines? So, is this in some sense a weaker proof, not covering as much as Gödel's proof? | |
| Apr 30, 2015 at 2:28 | history | edited | Jake | CC BY-SA 3.0 |
grammar
|
| Apr 30, 2015 at 2:07 | vote | accept | peterh | ||
| Apr 30, 2015 at 1:39 | history | answered | Jake | CC BY-SA 3.0 |