2 citations · 3 across the 7 of their papers we have counts for
13 papers
Strong Medvedev reducibilities and the KL-randomness problem
Bjørn Kjos-Hanssen, David J. Webb
While it is not known whether each real that is Kolmogorov-Loveland random is Martin-Löf random, i.e., whether , Kjos-Hanssen and Webb (2021) sho…
KL-randomness and effective dimension under strong reducibility
Bjørn Kjos-Hanssen, David J. Webb
We show that the (truth-table) Medvedev degree KLR of Kolmogorov--Loveland randomness coincides with that of Martin Löf randomness, MLR, answering a question of Miyabe. Next, an an…
On the degrees of constructively immune sets
Samuel D. Birns, Bjørn Kjos-Hanssen
Xiang Li (1983) introduced what are now called constructively immune sets as an effective version of immunity. Such have been studied in relation to randomness and minimal indices,…
Automatic complexity of Fibonacci and Tribonacci words
Bjørn Kjos-Hanssen
For a complexity function , the lower and upper -complexity rates of an infinite word are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\uph…
A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations
Bjørn Kjos-Hanssen
We show that Carmo and Jones' condition 5(e) conflicts with the other conditions on their models for contrary-to-duty obligations. We then propose a resolution to the conflict.
From eventually different functions to pandemic numberings
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen +1
A function is strongly non-recursive (SNR) if it is eventually different from each recursive function. We obtain hierarchy results for the mass problems associated with computing s…