The following pages link to Bjørn Kjos-Hanssen (Q490406):
Displayed 24 items.
- Low for random reals and positive-measure domination (Q5308140) (← links)
- Comparing DNR and WWKL (Q5311768) (← links)
- Only Human (Q5377998) (← links)
- The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion (Q5434516) (← links)
- Lowness for the Class of Schnorr Random Reals (Q5470706) (← links)
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination (Q5477626) (← links)
- Few Paths, Fewer Words: Model Selection With Automatic Structure Functions (Q5743090) (← links)
- Interpolating between the Jaccard distance and an analogue of the normalized information distance (Q5872870) (← links)
- The number of languages with maximum state complexity (Q5918753) (← links)
- The number of languages with maximum state complexity (Q5919655) (← links)
- Automatic complexity. A computable measure of irregularity (Q6063553) (← links)
- Lattice initial segments of the Turing degrees (Q6212481) (← links)
- Effective Banach spaces (Q6234699) (← links)
- Finding subsets of positive measure (Q6253789) (← links)
- Constructing a weak subset of a random set (Q6270371) (← links)
- Models of the Chisholm set (Q6275359) (← links)
- Planar digraphs for automatic complexity (Q6313491) (← links)
- A tractable case of the Turing automorphism problem: bi-uniformly $E_0$-invariant Cantor homeomorphisms (Q6323680) (← links)
- From eventually different functions to pandemic numberings (Q6334068) (← links)
- On the degrees of constructively immune sets (Q6366272) (← links)
- KL-randomness and effective dimension under strong reducibility (Q6366309) (← links)
- Strong Medvedev reducibilities and the KL-randomness problem (Q6397676) (← links)
- Maximal automatic complexity and context-free languages (Q6402678) (← links)
- Conditional automatic complexity and its metrics (Q6449249) (← links)