/explore
|
You are here 
|
terrytao.wordpress.com | ||
| | | | |
mattbaker.blog
|
|
| | | | | In my last blog post, I discussed a simple proof of the fact that pi is irrational. That pi is in fact transcendental was first proved in 1882 by Ferdinand von Lindemann, who showed that if $latex \alpha$ is a nonzero complex number and $latex e^\alpha$ is algebraic, then $latex \alpha$ must be transcendental. Since... | |
| | | | |
extremal010101.wordpress.com
|
|
| | | | | Suppose we want to understand under what conditions on $latex B$ we have $latex \begin{aligned} \mathbb{E} B(f(X), g(Y))\leq B(\mathbb{E}f(X), \mathbb{E} g(Y)) \end{aligned}$holds for all test functions, say real valued $latex f,g$, where $latex X, Y$ are some random variables (not necessarily all possible random variables!). If $latex X=Y$, i.e., $latex X$ and $latex Y$ are... | |
| | | | |
almostsuremath.com
|
|
| | | | | Continuing on from the previous post, I look at cases where the abstract concept of states on algebras correspond to classical probability measures. Up until now, we have considered commutative real algebras but, before going further, it will help to look instead at algebras over the complex numbers $latex {{\mathbb C}}&fg=000000$. In the commutative case,... | |
| | | | |
www.jeremykun.com
|
|
| | | Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility. | ||
