Explore >> Select a destination
|
You are here 
|
mathvoices.ams.org | ||
| | | | |
haggisthesheep.wordpress.com
|
|
| | | | | In The Imitation Game: Part 1 we looked at the early work of Alan Turing about universal computing machines, the limits of what computers can do, and whether computers could ever successfully imitate human brains. In this post we look at Turing's work doing codebreaking at Bletchley Park during the Second World War, and the... | |
| | | | |
www.quantamagazine.org
|
|
| | | | | Number theorist Andrew Granville on what mathematics really is - and why objectivity is never quite within reach. | |
| | | | |
gavinhoward.com
|
|
| | | | | I have found a lot of programmers that do not understand the Halting Problem and its implications, so here is my attempt to fix that. | |
| | | | |
www.greaterwrong.com
|
|
| | | The most common formalizations of Occam's Razor, Solomonoff induction and Minimum Description Length, measure the program size of a computation used in a hypothesis, but don't measure the running time or space requirements of the computation. What if this makes a mind vulnerable to finite forms of Pascal's Wager? A compactly specified wager can grow in size much faster than it grows in complexity. The utility of a Turing machine can grow much faster than its prior probability shrinks. | ||
