Explore >> Select a destination
|
You are here 
|
xorshammer.com | ||
| | | | |
dvt.name
|
|
| | | | | In the previous blog post in this series, we looked at Gödel's First Incompleteness Theorem, and came to the amazing conclusion that we can't compute certain kinds of functions in formal systems (like Javascript). Specifically, we looked at a special function, , which turned out to be non-computable. In case we forgot, the first incompleteness ... | |
| | | | |
almostsuremath.com
|
|
| | | | | I start these notes on stochastic calculus with the definition of a continuous time stochastic process. Very simply, a stochastic process is a collection of random variables $latex {\{X_t\}_{t\ge 0}}&fg=000000$ defined on a probability space $latex {(\Omega,\mathcal{F},{\mathbb P})}&fg=000000$. That is, for each time $latex {t\ge 0}&fg=000000$, $latex {\omega\mapsto X_t(\omega)}&fg=000000$ is a measurable function from $latex... | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | NB: I've opted to just get straight to the point with this post rather than attempting to introduce the subject first, so it may be of little interest to readers who aren't already interested in proving the completeness theorem for propositional logic. A PDF version of this document is available here. The key thing I... | |
| | | | |
cornellmath.wordpress.com
|
|
| | | When discussing the validity of the Axiom of Choice, the most common argument for not taking it as gospel is the Banach-Tarski paradox. Yet, this never particularly bothered me. The argument against the Axiom of Choice which really hit a chord I first heard at the Olivetti Club, our graduate colloquium. It's an extension... | ||
