Bjørn Kjos-Hanssen

Publication Activity (10 Years)

Years Active: 2003-2023
Publications (10 Years): 38

Top Topics

Finite Automata

Kullback Leibler

Top Venues

Computability and Complexity

Ann. Pure Appl. Log.

Publications

Bjørn Kjos-Hanssen
Conditional Automatic Complexity and Its Metrics. COCOON (1) (2023)
Bjørn Kjos-Hanssen
Conditional automatic complexity and its metrics. CoRR (2023)
Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
VC-dimensions of nondeterministic finite automata for words of equal length. Ann. Math. Artif. Intell. 90 (1) (2022)
Bjørn Kjos-Hanssen
Maximal automatic complexity and context-free languages. CoRR (2022)
Bjørn Kjos-Hanssen, Saroj Niraula, Soowhan Yoon
A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance. LFCS (2022)
Bjørn Kjos-Hanssen, David J. Webb
Strong Medvedev Reducibilities and the KL-Randomness Problem. CiE (2022)
Bjørn Kjos-Hanssen
Interpolating between the Jaccard distance and an analogue of the normalized information distance. J. Log. Comput. 32 (8) (2022)
Bjørn Kjos-Hanssen
Automatic complexity of Fibonacci and Tribonacci words. Discret. Appl. Math. 289 (2021)
Bjørn Kjos-Hanssen, David J. Webb
KL-Randomness and Effective Dimension Under Strong Reducibility. CiE (2021)
Samuel D. Birns, Bjørn Kjos-Hanssen
On the Degrees of Constructively Immune Sets. CiE (2021)
Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
VC-dimensions of nondeterministic finite automata for words of equal length. CoRR (2020)
Bjørn Kjos-Hanssen
A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations. CoRR (2020)
Bjørn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, Davin Takahashi
VC-dimensions of nondeterministic finite automata for words of equal length. ISAIM (2020)
Bjørn Kjos-Hanssen
Automatic complexity of Fibonacci and Tribonacci words. CoRR (2020)
Bjørn Kjos-Hanssen, Lei Liu
The Number of Languages with Maximum State Complexity. TAMC (2019)
Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
Planar digraphs for automatic complexity. CoRR (2019)
Bjørn Kjos-Hanssen
Few Paths, Fewer Words: Model Selection With Automatic Structure Functions. Exp. Math. 28 (1) (2019)
Bjørn Kjos-Hanssen
An Incompressibility Theorem for Automatic Complexity. CoRR (2019)
Achilles A. Beros, Bjørn Kjos-Hanssen, Daylan Kaui Yogi
Planar Digraphs for Automatic Complexity. TAMC (2019)
Bjørn Kjos-Hanssen, Lei Liu
The number of languages with maximum state complexity. CoRR (2019)
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen, André Nies
From Eventually Different Functions to Pandemic Numberings. CiE (2018)
Rod Downey, Denis R. Hirschfeldt, Bjørn Kjos-Hanssen
Preface. Theory Comput. Syst. 62 (7) (2018)
Bjørn Kjos-Hanssen
Automatic complexity of shift register sequences. Discret. Math. 341 (9) (2018)
Bjørn Kjos-Hanssen
Permutations of the Integers Induce only the Trivial automorphism of the Turing Degrees. Bull. Symb. Log. 24 (2) (2018)
Bjørn Kjos-Hanssen
On the Complexity of Automatic Complexity. Theory Comput. Syst. 61 (4) (2017)
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
Covering the recursive sets. Ann. Pure Appl. Log. 168 (4) (2017)
Achilles A. Beros, Mushfeq Khan, Bjørn Kjos-Hanssen
Effective Bi-immunity and Randomness. Computability and Complexity (2017)
Bjørn Kjos-Hanssen
Superposition as memory: unlocking quantum automatic complexity. CoRR (2017)
Bjørn Kjos-Hanssen
A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty Obligations. Stud Logica 105 (1) (2017)
Bjørn Kjos-Hanssen
Shift Registers Fool Finite Automata. WoLLIC (2017)
Bjørn Kjos-Hanssen
A Rigid Cone in the Truth-Table Degrees with Jump. Computability and Complexity (2017)
Bjørn Kjos-Hanssen
Superposition as Memory: Unlocking Quantum Automatic Complexity. UCNC (2017)
Bjørn Kjos-Hanssen
Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees. Computability and Complexity (2017)
Bjørn Kjos-Hanssen
The complexity of automatic complexity. CoRR (2016)
Bjørn Kjos-Hanssen
Shift registers fool finite automata. CoRR (2016)
Bjørn Kjos-Hanssen
Few paths, fewer words: model selection with automatic structure functions. CoRR (2016)
Bjørn Kjos-Hanssen
Models of the Chisholm set. CoRR (2016)
Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen, Richard A. Shore
The strength of the Grätzer-Schmidt theorem. Arch. Math. Log. 55 (5-6) (2016)
Malihe Alikhani, Bjørn Kjos-Hanssen, Amirarsalan Pakravan, Babak Saadat
Pricing complexity options. CoRR (2015)
Bjørn Kjos-Hanssen
Kolmogorov structure functions for automatic complexity. Theor. Comput. Sci. 607 (2015)
Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn
Covering the Recursive Sets. CiE (2015)
Kayleigh Hyde, Bjørn Kjos-Hanssen
Nondeterministic Automatic Complexity of Overlap-Free and Almost Square-Free Words. Electron. J. Comb. 22 (3) (2015)
Malihe Alikhani, Bjørn Kjos-Hanssen, Amirarsalan Pakravan, Babak Saadat
Pricing complexity options. Algorithmic Finance 4 (3-4) (2015)
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
How much randomness is needed for statistics? Ann. Pure Appl. Log. 165 (9) (2014)
Bjørn Kjos-Hanssen
Kolmogorov Structure Functions for Automatic Complexity in Computational Statistics. COCOA (2014)
Kayleigh Hyde, Bjørn Kjos-Hanssen
Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words. COCOON (2014)
Bjørn Kjos-Hanssen, Paul Kim Long V. Nguyen, Jason M. Rute
Algorithmic randomness for Doob's martingale convergence theorem in continuous time. Log. Methods Comput. Sci. 10 (4) (2014)
Cameron E. Freer, Bjørn Kjos-Hanssen, André Nies, Frank Stephan
Algorithmic Aspects of Lipschitz Functions. Comput. 3 (1) (2014)
Kayleigh Hyde, Bjørn Kjos-Hanssen
Nondeterministic automatic complexity of almost square-free and strongly cube-free words. CoRR (2014)
Bjørn Kjos-Hanssen
Kolmogorov structure functions for automatic complexity in computational statistics. CoRR (2014)
Bjørn Kjos-Hanssen
Recovering randomness from an asymptotic Hamming distance Log. Methods Comput. Sci. 9 (3) (2013)
Bjørn Kjos-Hanssen, Antoine Taveneaux, Neil Thapen
How Much Randomness Is Needed for Statistics? CiE (2012)
Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon
Lowness notions, measure and domination. J. Lond. Math. Soc. 85 (3) (2012)
David Diamondstone, Bjørn Kjos-Hanssen
Martin-Löf randomness and Galton-Watson processes. Ann. Pure Appl. Log. 163 (5) (2012)
Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch
Arithmetic complexity via effective names for random sequences. ACM Trans. Comput. Log. 13 (3) (2012)
Bjørn Kjos-Hanssen
A Strong Law of computationally Weak Subsets. J. Math. Log. 11 (1) (2011)
Bjørn Kjos-Hanssen, André Nies, Frank Stephan, Liang Yu
Higher Kurtz randomness. Ann. Pure Appl. Log. 161 (10) (2010)
Bjørn Kjos-Hanssen, Frank Stephan, Jason Teutsch
Enumerating randoms CoRR (2010)
Bjørn Kjos-Hanssen
A strong law of computationally weak subsets. Electron. Colloquium Comput. Complex. 17 (2010)
Bjørn Kjos-Hanssen
The probability distribution as a computational resource for randomness testing. J. Log. Anal. 2 (2010)
Bjørn Kjos-Hanssen, Richard A. Shore
Lattice initial segments of the hyperdegrees. J. Symb. Log. 75 (1) (2010)
Bjørn Kjos-Hanssen, Jan Reimann
The Strength of the Besicovitch-Davies Theorem. CiE (2010)
David Diamondstone, Bjørn Kjos-Hanssen
Members of Random Closed Sets. CiE (2009)
Stephen Binns, Bjørn Kjos-Hanssen
Finding paths through narrow and wide trees. J. Symb. Log. 74 (1) (2009)
Bjørn Kjos-Hanssen, Anil Nerode
Effective dimension of points visited by Brownian motion. Theor. Comput. Sci. 410 (4-5) (2009)
Paul Brodhead, Bjørn Kjos-Hanssen
The Strength of the Grätzer-Schmidt Theorem. CiE (2009)
Bjørn Kjos-Hanssen, André Nies
Superhighness. Notre Dame J. Formal Log. 50 (4) (2009)
Paul Brodhead, Bjørn Kjos-Hanssen
Numberings and Randomness. CiE (2009)
Bjørn Kjos-Hanssen, Alberto J. Evangelista
Google distance between words CoRR (2009)
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. 49 (1) (2008)
Bjørn Kjos-Hanssen, Anil Nerode
The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. LFCS (2007)
Bjørn Kjos-Hanssen, Wolfgang Merkle, Frank Stephan
Kolmogorov Complexity and the Recursion Theorem. STACS (2006)
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon
On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. 71 (1) (2006)
Bjørn Kjos-Hanssen, André Nies, Frank Stephan
Lowness for the Class of Schnorr Random Reals. SIAM J. Comput. 35 (3) (2005)
Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman
Comparing DNR and WWKL. J. Symb. Log. 69 (4) (2004)
Bjørn Kjos-Hanssen
Local initial segments of the Turing degrees. Bull. Symb. Log. 9 (1) (2003)