# Tagged Questions

**3**

votes

**2**answers

241 views

### Is There An Algorithmic Complexity Of A Random Distribution

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 ...

**11**

votes

**0**answers

142 views

### 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 ...

**3**

votes

**0**answers

90 views

### Is a parametric family which is universally consistent for multiple quantiles impossible?

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 ...

**5**

votes

**1**answer

297 views

### An eventually different function adding no Solovay real nor dominating function?

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 ...

**4**

votes

**6**answers

884 views

### Are there nonequivalent randomnesses?

There are nonequivalent geometries, nonequivalent groups finite and infinite, nonequivalent logics ( fregean and nofregean http://www.formalontology.it/suszkor.htm), even nonequivalent logicians;-)
...