Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
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... | |
| | | | |
jdh.hamkins.org
|
|
| | | | | I'd like to share a simple proof I've discovered recently of a surprising fact: there is a universal algorithm, capable of computing any given function! Wait, what? What on earth do I ... | |
| | | | |
cromwell-intl.com
|
|
| | | | | Hypercomputation is a wished-for magic that simply can't exist given the way that logic and mathematics work. Its purported imminence serves as an excuse for AI promoters. | |
| | | | |
www.quantamagazine.org
|
|
| | | His incompleteness theorems destroyed the search for a mathematical theory of everything. Nearly a century later, we're still coming to grips with the... | ||
