/explore
|
You are here 
|
scottaaronson.blog | ||
| | | | |
www.lesswrong.com
Paul Christiano has deviseda new fundamental approachto the "Löb Problem" wherein Löb's Theorem seems to pose an obstacle to AIs building successor... |
|
| | | | | ||
| | | | |
blog.computationalcomplexity.org
As someone who has literally written a book on the topic, I have had many people over the years send me their attempts at P v NP proofs. On ... |
|
| | | | | ||
| | | | |
rjlipton.com
A discussion of Cantor's famous diagonal method Georg Cantor discovered his famous diagonal proof method, which he used to give his second proof that the real numbers are uncountable. In an earlier discussion I have given the first proof that Cantor discovered years earlier. Today I want to talk about what I plan to cover... |
|
| | | | | ||
| | | | |
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... |
|
| | | |||
