/explore
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
daniellefong.com
|
|
| | | | | The following occurred to me on a run about two years ago: It's not given much press, but the the Halting Problem is intimately related to Gödel's First Incompleteness Theorem. Indeed it produces it as a correllary. Historically, Gödel's incompleteness results were proved by hacking arithmetic into a Turing complete system, and this is still... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... | |
| | | | |
dvt.name
|
|
| | | | | In the previous blog post in this series, we looked at Gödel's First Incompleteness Theorem, and came to the amazing conclusion that we can't compute certain kinds of functions in formal systems (like Javascript). Specifically, we looked at a special function, , which turned out to be non-computable. In case we forgot, the first incompleteness ... | |
| | | | |
www.cs.uic.edu
|
|
| | | |||
