Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
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. | |
| | | | |
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... | |
| | | | |
ethical.today
|
|
| | | Ethical Today is your news, entertainment, lifestyle website. | ||
