Explore >> Select a destination
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
www.forwardscattering.org
|
|
| | | | | ||
| | | | |
www.yodaiken.com
|
|
| | | | | ||
| | | | |
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... | |
| | | | |
jmanton.wordpress.com
|
|
| | | If $latex Y$ is a $latex \sigma(X)$-measurable random variable then there exists a Borel-measurable function $latex f \colon \mathbb{R} \rightarrow \mathbb{R}$ such that $latex Y = f(X)$. The standard proof of this fact leaves several questions unanswered. This note explains what goes wrong when attempting a "direct" proof. It also explains how the standard proof... | ||
