Explore >> Select a destination
|
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... | |
| | | | |
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... | |
| | | | |
www.yodaiken.com
|
|
| | | | | ||
| | | | |
polymathprojects.org
|
|
| | | (From a post "the music of the primes" byMarcus du Sautoy.) A new polymath proposal over Terry Tao's blog who wrote: "Building on the interest expressed in the comments tothis previous post, I am now formally proposing to initiate a "Polymath project" on the topic of obtaining new upper bounds on thede Bruijn-Newman constant.... | ||
