B. Kjos-Hanssen

activity

20092026

most citedKolmogorov complexity and the Recursion Theorem

76 citations · 440 across the 53 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

cs.DM2026

The exact asymptotic constant in the metric dimension of Jaccard space

Bjørn Kjos-Hanssen

Let $X$ be a finite set with $∣ X ∣ = n$ and let $Jac (a, b) = ∣ a △ b ∣/∣ a \cup b ∣$ be the Jaccard distance on the power set $2^{X}$ . Lladser and Paradise recently proved t…

cs.DM2020

Automatic complexity of Fibonacci and Tribonacci words

Bjørn Kjos-Hanssen

For a complexity function $C$ , the lower and upper $C$ -complexity rates of an infinite word $x$ are \[ \underline{C}(\mathbf x)=\liminf_{n\to\infty} \frac{C(\mathbf{x}\uph…