The following pages link to Bjørn Kjos-Hanssen (Q490406):
Displayed 50 items.
- Nondeterministic automatic complexity of overlap-free and almost square-free words (Q490407) (← links)
- The strength of the Grätzer-Schmidt theorem (Q506962) (← links)
- Covering the recursive sets (Q508828) (← links)
- A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations (Q519858) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- Automatic complexity of shift register sequences (Q724846) (← links)
- Martin-Löf randomness and Galton-Watson processes (Q764271) (← links)
- Kolmogorov structure functions for automatic complexity (Q896123) (← links)
- Superhighness (Q987937) (← links)
- Effective dimension of points visited by Brownian motion (Q1004080) (← links)
- Infinite subsets of random sets of integers (Q1012969) (← links)
- Self-embeddings of computable trees (Q1049747) (← links)
- From eventually different functions to pandemic numberings (Q1670726) (← links)
- Shift registers fool finite automata (Q1685924) (← links)
- On the complexity of automatic complexity (Q1694011) (← links)
- VC-dimensions of nondeterministic finite automata for words of equal length (Q2075374) (← links)
- Strong Medvedev reducibilities and the KL-randomness problem (Q2104264) (← links)
- On the degrees of constructively immune sets (Q2117765) (← links)
- KL-randomness and effective dimension under strong reducibility (Q2117810) (← links)
- A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance (Q2151402) (← links)
- Automatic complexity of Fibonacci and tribonacci words (Q2217496) (← links)
- Planar digraphs for automatic complexity (Q2327457) (← links)
- Superposition as memory: unlocking quantum automatic complexity (Q2400959) (← links)
- How much randomness is needed for statistics? (Q2453071) (← links)
- Extracting randomness within a subset is hard (Q2663792) (← links)
- Randomness extraction and asymptotic Hamming distance (Q2848372) (← links)
- Lowness notions, measure and domination (Q2890316) (← links)
- Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words (Q2920445) (← links)
- Algorithmic randomness for Doob's martingale convergence theorem in continuous time (Q2938765) (← links)
- Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics (Q2942440) (← links)
- Arithmetic complexity via effective names for random sequences (Q2946673) (← links)
- A Rigid Cone in the Truth-Table Degrees with Jump (Q2970975) (← links)
- Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees (Q2970981) (← links)
- Effective Bi-immunity and Randomness (Q2970984) (← links)
- Kolmogorov complexity and strong approximation of Brownian motion (Q3092856) (← links)
- Kolmogorov complexity and the Recursion Theorem (Q3093478) (← links)
- A STRONG LAW OF COMPUTATIONALLY WEAK SUBSETS (Q3094357) (← links)
- The probability distribution as a computational resource for randomness testing (Q3145956) (← links)
- Covering the Recursive Sets (Q3195679) (← links)
- The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (Q3530396) (← links)
- Numberings and Randomness (Q3576037) (← links)
- Members of Random Closed Sets (Q3576047) (← links)
- The Strength of the Besicovitch-Davies Theorem (Q3576210) (← links)
- Finding paths through narrow and wide trees (Q3616357) (← links)
- Local Initial Segments of The Turing Degrees (Q4432542) (← links)
- PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES (Q4580034) (← links)
- Pricing complexity options (Q4586430) (← links)
- Algorithmic Aspects of Lipschitz Functions (Q4979765) (← links)
- An incompressibility theorem for automatic complexity (Q5154787) (← links)
- Lattice initial segments of the hyperdegrees (Q5190191) (← links)