/explore
|
You are here 
|
almostsuremath.com | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
raku-advent.blog
By Wim Vanderbauwhede Last year, in Perl land, I discussed the result of my attempts to optimize the performance of an expression parser which is part of my Perl-based Fortran source-to-source compiler. An expression parser takes strings representing expressions in a programming language (in my case Fortran) and turns it into a data structure called... |
|
| | | | | ||
| | | | |
codeblog.jonskeet.uk
Last time we looked into the boundary between the caller of an async method and the method itself. This time I'm going to show the same sort of "skeleton API" but for awaitable types. This is at the heart of C# 5's async feature: within an async method, you can include "await" expressions. You have... |
|
| | | | | ||
| | | | |
codeblog.jonskeet.uk
While I was answering a Stack Overflow question on the performance implications of using a for loop instead of a foreach loop (or vice versa) I promised to blog about the results - particularly as I was getting different results to some other posters. On Saturday I started writing the bigger benchmark (which I will... |
|
| | | |||
