Explore >> Select a destination
|
You are here 
|
www.lesswrong.com | ||
| | | | |
www.cs.uic.edu
|
|
| | | | | ||
| | | | |
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 ... | |
| | | | |
blog.sigfpe.com
|
|
| | | | | [AI summary] The article explains why defining a truth predicate for set theory (ZF) is impossible despite the success of similar definitions in propositional calculus and Peano arithmetic, based on Tarski's theorem and the limitations of transfinite recursion when applied to infinite collections of children. | |
| | | | |
lawrencecpaulson.github.io
|
|
| | | |||
