43 citations · 59 across the 5 of their papers we have counts for
5 papers · 1 filter
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs
Denis R. Hirschfeldt, Carl G. Jockusch, Bjørn Kjos-Hanssen +2
We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT im…
How much randomness is needed for statistics?
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure , a choice needs to be made. One approach is to allow randomn…
The probability distribution as a computational resource for randomness testing
Bjørn Kjos-Hanssen
When testing a set of data for randomness according to a probability distribution that depends on a parameter, access to this parameter can be considered as a computational resourc…
Self-embeddings of computable trees
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman +2
We divide the class of infinite computable trees into three types. For the first and second types, computes a nontrivial self-embedding while for the third type computes…
Kolmogorov complexity and strong approximation of Brownian motion
Bjørn Kjos-Hanssen, Tamás Szabados
Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the -step walk is within a uniform…