Explore >> Select a destination
|
You are here 
|
blog.sigfpe.com | ||
| | | | |
xorshammer.com
|
|
| | | | | There are many functions from $latex \mathbb{N}$ to $latex \mathbb{N}$ that cannot be computed by any algorithm or computer program. For example, a famous one is the halting problem, defined by $latex f(n) = 0$ if the $latex n$th Turing machine halts and $latex f(n) = 1$ if the $latex n$th Turing machine does not... | |
| | | | |
math.andrej.com
|
|
| | | | | ||
| | | | |
scottaaronson.blog
|
|
| | | | | (Thanks to Amit Sahai for spurring me to write this post!) The Background We all remember Gödel's First Incompleteness Theorem from kindergarten. This is the thing that, given a formal system F, constructs a sentence G(F) that's a mathematical encoding of "This sentence is not provable in F." If F proves G(F), then F proves... | |
| | | | |
profmattstrassler.com
|
|
| | | Einstein's gravity is widely seen as the most beautiful theory in all of physics. But dark energy, quantum physics, and string theory all raise questions. | ||
