Has anyone studied an equivalent to algorithmic complexity for probability distributions? This would be a measure which was similar to Kolmogorov complexity but look at the complexity of a (discreet ...
Savings property: A transformation which turns nonnegative martingales into uniformly integrable ones
Background I work in a subfield of computability theory called algorithmic randomness. We have been using martingales as long as probability theory (going back to work of von Mises). However, since ...
Suppose I am dead-set on using Bayesian inference on independent and identically distributed data, but I'm lazy and insist on using a parametric likelihood function come what may. I'd be reassured to ...
Definitions I believe set theorists have studied all of the following three notions in the context of forcing extensions of a model of ZFC, $M$ (hopefully the terminology is the standard one). A ...
There are nonequivalent geometries, nonequivalent groups finite and infinite, nonequivalent logics ( fregean and nofregean http://www.formalontology.it/suszkor.htm), even nonequivalent logicians;-) ...