
{"id":2,"date":"2012-05-10T15:04:42","date_gmt":"2012-05-11T01:04:42","guid":{"rendered":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/?page_id=2"},"modified":"2026-10-21T13:45:29","modified_gmt":"2026-10-21T23:45:29","slug":"papers","status":"publish","type":"page","link":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/papers\/","title":{"rendered":"Publications"},"content":{"rendered":"\n\nFor very recent papers see <a href=\"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/preprints\/\">Preprints<\/a>.\n<h3>Recent conference publications<\/h3>\n<ol>\n \t<li>Bj\u00f8rn Kjos-Hanssen and Swarnalakshmi Lakshmanan, <a href=\"https:\/\/arxiv.org\/abs\/2603.00861\">Unbounded length minimal synchronizing words for quantum channels over qutrits<\/a>. Quantum Communications, Networking, and Computing (QCNC 2026). <a href=\"https:\/\/ieeexplore.ieee.org\/document\/11500341\">IEEE Xplore<\/a>.<\/li>\n \t<li>Index set complexity for congruence lattices of lattices. With Paul Nguyen. <a href=\"https:\/\/wollic2025.github.io\/accepted\/\">WoLLIC 2025<\/a>, Lecture Notes in Computer Science <strong>15942<\/strong> (2025), 243--259.<\/li>\n \t<li>Joey Chen, Bj\u00f8rn Kjos-Hanssen, Ivan Koswara, Linus Richter, and Frank Stephan. <a href=\"https:\/\/arxiv.org\/abs\/2510.07696\">Languages of Words of Low Automatic Complexity Are Hard to Compute<\/a>. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume <strong>360<\/strong>, pp. 24:1-24:19, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2025)\u00a0<a href=\"https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2025.24\">https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2025.24<\/a>.<\/li>\n<\/ol>\n<h3 id=\"journal\">Journal articles, books, and book chapters<\/h3>\n<ol reversed=\"reversed\">\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/2604.17703\">Classification and deontic explosion for contrary-to-duty obligations<\/a>. Studia Logica <strong>115<\/strong> (2027), to appear, see <a href=\"https:\/\/link.springer.com\/article\/10.1007\/s11225-026-10249-6\">https:\/\/link.springer.com\/article\/10.1007\/s11225-026-10249-6<\/a>.<\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/2511.06617\">Concatenative nonmonotonicity and optimal links in HP protein folding models<\/a>. Journal of Experimental Mathematics <strong>2<\/strong> (2026), 172\u2013193. <a href=\"https:\/\/doi.org\/10.56994\/JXM.002.001.007\">https:\/\/doi.org\/10.56994\/JXM.002.001.007<\/a><\/li>\n \t<li><a href=\"http:\/\/arxiv.org\/abs\/1908.05381\">A tractable case of the Turing automorphism problem: bi-uniformly $E_0$-invariant Cantor homeomorphisms<\/a>. Higher recursion theory and set theory. <a href=\"https:\/\/www.worldscientific.com\/series\/lnimsnus\">Lecture Notes Series<\/a>, Institute of Mathematical Sciences, National University of Singapore <b>44<\/b>\u00a0(2025), World Scientific Publishing, Hackensack, NJ.<\/li>\n \t<li style=\"background-color: #e2e2c7;\"><em>Automatic complexity: a computable measure of irregularity<\/em>. <a href=\"https:\/\/www.degruyter.com\/serial\/gsla-b\/html?lang=en#volumes\">De Gruyter Series in Logic and Its Applications<\/a> <b>12<\/b> (2024). Chapter 7 contains material from <span style=\"background-color: lightgray;\"><a href=\"https:\/\/arxiv.org\/abs\/2308.16292\">Conditional automatic complexity and its metrics<\/a>. COCOON 2023, Lecture Notes in Computer Science <strong>14422<\/strong> (2024), 15-28<\/span>.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/2206.10130\">Maximal automatic complexity and context-free languages<\/a>. Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore <b>42<\/b> (2023), 335--352.<\/li>\n \t<li><a href=\"https:\/\/math.hawaii.edu\/~bjoern\/immunity-diagonalization.pdf\">Immunity, diagonalisation and the complexity of mass problems<\/a> (with Achilles Beros, Mushfeq Khan, and Andre Nies), Aspects of Computation. Lecture Notes Series, Institute of Mathematical Sciences, National University of Singapore <b>42<\/b> (2023), 115--139. Combined final version of two conference papers:\n<ul>\n \t<li><span style=\"background-color: lightgray;\">Beros, Khan, Kjos-Hanssen, and Nies: <a href=\"https:\/\/math.hawaii.edu\/~bjoern\/Publications\/CiE-2018-pandemic.pdf\">From eventually different functions to pandemic numberings<\/a>, <em>Lecture Notes in Computer Science<\/em> <b>10936<\/b> (2018), 97--106. Computability in Europe 2018.<\/span><\/li>\n \t<li><span style=\"background-color: lightgray;\">Beros, Khan, and Kjos-Hanssen: <a href=\"https:\/\/arxiv.org\/abs\/1610.08615\">Effective bi-immunity and randomness<\/a>, Downey Festschrift, <em>Lecture Notes in Computer Science<\/em> <b>10010<\/b> (2017) 633--643.<\/span><\/li>\n<\/ul>\n<\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/2111.02498\">Interpolating between the Jaccard distance and an analogue of the normalized information distance<\/a>. Journal of Logic and Computation <b>32<\/b> (2022), no. 8, 1611\u20131623. Preliminary version: Bj\u00f8rn Kjos-Hanssen, Saroj Niraula,\u00a0Soowhan Yoon. A parametrized family of Tversky metrics connecting the Jaccard distance to an analogue of the normalized information distance. <span style=\"background-color: lightgray;\">Lectures Notes in Computer Science <b>13137<\/b>, 112--124. Logical Foundations of Computer Science 2022.<\/span> <a href=\"https:\/\/leanprover-community.github.io\/papers.html\">Formalized<\/a> at the time of publication.<\/li>\n \t<li style=\"background-color: #e2e2c7;\">Bj\u00f8rn Kjos-Hanssen and Lei Liu: <a href=\"https:\/\/arxiv.org\/abs\/1902.00815\">The number of languages with maximum state complexity<\/a>, <a href=\"https:\/\/link.springer.com\/journal\/12\/volumes-and-issues\">Algebra Universalis<\/a> <b>83<\/b> (2022), no. 3. <span style=\"background-color: lightgray;\"><em>Lecture Notes in Computer Science<\/em> <strong>11436<\/strong> (2019), 394--409. TAMC 2019 (Theory and Applications of Models of Computation).<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\">Bj\u00f8rn Kjos-Hanssen, Clyde James Felix, Sun Young Kim, Ethan Lamb, and Davin Takahashi, <a title=\"Note: Theorem 14 holds for all sufficiently large n rather than all n.\" href=\"\nhttp:\/\/arxiv.org\/abs\/2001.02309\">VC-dimensions of nondeterministic finite automata for words of equal length<\/a>. <span style=\"background-color: lightgray;\">International Symposium on Artificial Intelligence and Mathematics (<a href=\"http:\/\/isaim2020.cs.ou.edu\/\">ISAIM<\/a>) 2020<\/span>. <em>Annals of Mathematics and Artificial Intelligence<\/em> <b>90<\/b> (2022), no. 1, 93--105.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1908.10843\">An incompressibility theorem for automatic complexity<\/a>. <em>Forum of Mathematics Sigma<\/em> <b>9<\/b> (2021), E62.<\/li>\n \t<li>Bj\u00f8rn Kjos-Hanssen, <a href=\"http:\/\/arxiv.org\/abs\/2010.07275\">Automatic complexity of Fibonacci and Tribonacci words<\/a>. <em>Discrete Applied Mathematics<\/em> <b>289<\/b> (31 January 2021), 446--454.<\/li>\n \t<li style=\"background-color: #e2e2c7;\">Bj\u00f8rn Kjos-Hanssen and Lu Liu: <a href=\"https:\/\/arxiv.org\/abs\/1602.03690\">Extracting randomness within a subset is hard<\/a>, <em>European Journal of Mathematics<\/em> <b>6<\/b> (2020), no. 4, 1438\u20131451.<\/li>\n \t<li><a href=\"https:\/\/philpapers.org\/rec\/KJOOHA\">Only human<\/a>. <em>Notices of the American Mathematical Society<\/em> <strong>66<\/strong> (2019), no. 4, 556--561.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1608.01399\">Few paths, fewer words: model selection with automatic structure functions<\/a>. <em>Experimental Mathematics<\/em> <strong>28<\/strong> (2019), no. 1, 121--127.<\/li>\n \t<li style=\"background-color: #e2e2c7;\">Downey, Hirschfeldt and Kjos-Hanssen: <a href=\"https:\/\/doi.org\/10.1007\/s00224-018-9853-6\">Preface<\/a>. Special issue on \"Computability, complexity and randomness'' (CCR 2016). Held in Honolulu, January 4-8, 2016. <em>Theory of Computing Systems<\/em> <strong>62<\/strong> (2018) no. 7, 1553\u20131554.<\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/1607.08226\">Automatic complexity of shift register sequences<\/a>. Discrete Mathematics <strong>341<\/strong> (2018), no. 9, 2409\u20132417. <span style=\"background-color: lightgray;\"><em>Lecture Notes in Computer Science<\/em> <strong>10388<\/strong> (2017), 170-181. Workshop on Logic, Language, Information and Computation (WoLLIC) 2017.<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/1603.00525\">Permutations of the integers induce only the trivial automorphism of the Turing degrees<\/a>, Bulletin of Symbolic Logic <strong>24<\/strong> (2018), no. 2, 165-174. <span style=\"background-color: lightgray;\">Downey Festschrift, <em>Lecture Notes in Computer Science<\/em> <b>10010<\/b> (2017) 599--607.<\/span><\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1607.06106\">On the complexity of automatic complexity<\/a>. <em>Theory of Computing Systems<\/em> <strong>61<\/strong> (2017), no. 4, 1427-\u20131439.<\/li>\n \t<li><a href=\"http:\/\/arxiv.org\/abs\/2008.12827\">A conflict between some semantic conditions of Carmo and Jones for contrary-to-duty obligations<\/a>, <em>Studia Logica<\/em> <strong>105<\/strong> (2017), no. 1, 173--178.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1712.05875\">Covering the recursive sets<\/a> (with Frank Stephan and Sebastiaan Terwijn), <em>Annals of Pure and Applied Logic<\/em> <strong>168<\/strong> (2017), no. 4, 804--823. <span style=\"background-color: lightgray;\">Computability in Europe, <em>Lecture Notes in Computer Science<\/em> <b>9136<\/b> (2015), 44\u201453.<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2167\">The Strength of the Gr\u00e4tzer-Schmidt theorem<\/a> (with Katie Brodhead, Mushfeq Khan, William A. Lampe, Paul Kim Long V. Nguyen, and Richard A. Shore). <em>Archive for Mathematical Logic<\/em> <b>55<\/b> (2016), no. 5, 687\u2014704. <span style=\"background-color: lightgray;\">Computability in Europe, <em>Lecture Notes in Computer Science<\/em> <b>5635<\/b> (2009), 59\u201467.<\/span><\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1409.0584\">Kolmogorov structure functions for automatic complexity<\/a>. <em>Theoretical Computer Science<\/em> <b>607<\/b> (2015), no. 3, 435\u2014445. <span style=\"background-color: lightgray;\"><em>Lecture Notes in Computer Science<\/em> (<a href=\"http:\/\/theory.utdallas.edu\/COCOA2014\/\">COCOA 2014<\/a>): Kolmogorov structure functions for automatic complexity in computational statistics.<\/span><\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1505.03587\">Pricing complexity options<\/a> (with M. Alikhani, A. Pakravan, and B. Saadat), <a href=\"http:\/\/algorithmicfinance.org\/\">Algorithmic Finance<\/a> <b>4<\/b> (2015), no. 3-4, 127-137.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1402.3856\">Nondeterministic automatic complexity of overlap-free and almost square-free words<\/a> (with K. Hyde). <a href=\"http:\/\/www.combinatorics.org\/\">Electronic Journal of Combinatorics<\/a> <b>22<\/b> (2015), no. 3, Paper 3.22, 18 pp. <span style=\"background-color: lightgray;\">Nondeterministic automatic complexity of almost square-free and strongly cube-free words, <a href=\"http:\/\/www.cs.gsu.edu\/COCOON2014\/\">COCOON 2014<\/a>, <em>Lecture Notes in Computer Science<\/em> <b>8591<\/b> (2014), 61\u201470.<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/1411.0186\">Algorithmic randomness for Doob's martingale convergence theorem in continuous time<\/a> (with Paul Kim Long V. Nguyen and Jason M. Rute). <a href=\"http:\/\/www.lmcs-online.org\/ojs\/regularIssues.php?id=43\">Logical Methods in Computer Science<\/a> <b>10<\/b> (2014) no. 4, Paper 12.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2862\"> How much randomness is needed for statistics? <\/a> (with Antoine Taveneaux and Neil Thapen). Annals of Pure and Applied Logic <b>165<\/b> (2014), no. 9, 1470-1483. <span style=\"background-color: lightgray;\">Computability in Europe, <em>Lecture Notes in Computer Science<\/em> <b>7318<\/b> (2012), 395\u2014404.<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"\"><a href=\"https:\/\/arxiv.org\/abs\/1402.2429\">Algorithmic aspects of Lipschitz functions<\/a> (with Cameron Freer, Andr\u00e9 Nies, and Frank Stephan). <a href=\"http:\/\/www.iospress.nl\/journal\/computability\/\">Computability<\/a> <b>3<\/b> (2014), no. 1, 45-61.<\/li>\n \t<li title=\"2013-09-25\"><a href=\"https:\/\/arxiv.org\/abs\/1008.0821\">Randomness extraction and asymptotic Hamming distance<\/a> (with Cameron Freer). <em>Logical Methods in Computer Science<\/em> <b>9<\/b> (2013) no. 3, Paper 27.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2011-07-21\"><a href=\"https:\/\/arxiv.org\/abs\/1008.4825\"> Arithmetic complexity via effective names for random sequences <\/a> (with Frank Stephan and Jason R. Teutsch). <span class=\"newjournal\"> ACM Transactions on Computational Logic<\/span> <b>13<\/b>, no. 3 (<span class=\"journal\">July 2012<\/span>), Art. 24, 18 pp.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2011-02-18\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2898\"> Lowness notions, measure, and domination <\/a> (with Joseph S. Miller and Reed Solomon). <span class=\"newjournal\"> Journal of the London Mathematical Society <\/span> <b>85<\/b> (2012), no. 3, 869\u2013888.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2011-06-21\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2875\"> Martin-L\u00f6f randomness and Galton-Watson processes <\/a> (with David Diamondstone). <span class=\"newjournal\"> Annals of Pure and Applied Logic <\/span> <b>163<\/b> (2012), no. 5, 519-529. <span style=\"background-color: lightgray;\">Members of random closed sets. Computability in Europe, <i>Lecture Notes in Computer Science<\/i> <b>5635<\/b> (2009), 144\u2014153.<\/span><\/li>\n \t<li title=\"2010-07-11\"><a href=\"https:\/\/arxiv.org\/abs\/1408.1967\">A strong law of computationally weak subsets<\/a>, <em>Journal of Mathematical Logic<\/em> <b>11<\/b> (2011) no. 1, 1\u201410. See also Electronic Colloquium on Computational Complexity, <a href=\"http:\/\/eccc.hpi-web.de\/report\/2010\/150\">Report No. 150 (2010)<\/a>.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/0901.3933\">Kolmogorov complexity and the recursion theorem<\/a> (with Wolfgang Merkle and Frank Stephan). <em>Transactions of the American Mathematical Society<\/em> <b>363<\/b> (2011) no. 10, 5465\u20145480. <span style=\"background-color: lightgray;\">STACS 2006, <i> Lecture Notes in Computer Science<\/i> <b>3884<\/b> (2006), pp. 149\u2014161.<\/span><\/li>\n \t<li title=\"2010-08-12\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2278\">Kolmogorov complexity and strong approximation of Brownian motion<\/a> (with Tam\u00e1s Szabados). <em>Proceedings of the American Mathematical Society<\/em> <b>139<\/b> (2011) no. 9, 3307\u20143316.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2010-04-22\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2850\"> The probability distribution as a computational resource for randomness testing<\/a>. <em>Journal of Logic and Analysis<\/em> <b>2<\/b> (2010), no. 10, 1\u201413.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2896\"> Higher Kurtz randomness <\/a> (with Andr\u00e9 Nies, Frank Stephan, and Liang Yu). <em>Annals of Pure and Applied Logic<\/em> <b>161<\/b> (2010), no. 10, 1280\u20141290.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2008-08-09\"><a href=\"https:\/\/arxiv.org\/abs\/1408.3147\">Lattice initial segments of the hyperdegrees<\/a> (with Richard A. Shore). <em>Journal of Symbolic Logic<\/em> <b>75<\/b> (2010), no. 1, 103\u2014130.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2845\">Superhighness<\/a> (with Andr\u00e9 Nies). <em>Notre Dame Journal of Formal Logic<\/em> <b>50<\/b> (2009), no. 4, 445\u2014452.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2857\">Finding paths through narrow and wide trees<\/a> (with Stephen E. Binns). <em>Journal of Symbolic Logic<\/em> <b>74<\/b> (2009), no. 1, 349\u2014360.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2881\">Infinite subsets of random sets of integers<\/a>. <em>Mathematical Research Letters<\/em> <b>16<\/b> (2009), no. 1, 103\u2014110.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2883\">Effective dimension of points visited by Brownian motion<\/a> (with Anil Nerode). <em>Theoretical Computer Science<\/em> <b>410<\/b> (2009), no. 4-5, 347\u2014354. <span style=\"background-color: lightgray;\">The law of the iterated logarithm for algorithmically random paths of Brownian motion. Logical Foundations of Computer Science, <i>Lecture Notes in Computer Science<\/i> <b>4514<\/b> (2007), pp. 310\u2014317.<\/span><\/li>\n \t<li style=\"background-color: #e2e2c7;\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2897\">The strength of some combinatorial principles related to Ramsey's theorem<\/a> (with Denis R. Hirschfeldt, Carl G. Jockusch, Steffen Lempp, and Theodore A. Slaman.) Computational Prospects of Infinity. Part II: Presented Talks, <em>Lecture Notes Series, Institute of Mathematical Sciences, National University of Singapore<\/em> <b>15<\/b>, World Scientific Publishing, Hackensack, NJ, 2008, pp. 143\u2014162.<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2286\">Self-embeddings of computable trees<\/a> (with Stephen Binns, Manuel Lerman, Jim Schmerl, and Reed Solomon). <em>Notre Dame Journal of Formal Logic<\/em> <b>49<\/b> (2008), no. 1, 1\u201437.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2171\">Low for random reals and positive-measure domination<\/a>. <em>Proceedings of the American Mathematical Society<\/em> <b>135<\/b> (2007), no. 11, 3703\u20143709 (electronic).<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2282\">On a conjecture of Dobrinen and Simpson concerning almost everywhere domination<\/a> (with Stephen Binns, Manuel Lerman, and Reed Solomon). <em>Journal of Symbolic Logic<\/em> <b>71<\/b> (2006), no. 1, 119\u2014136.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2893\">Lowness for the class of Schnorr random reals<\/a> (with Andr\u00e9 Nies and Frank Stephan). <em>SIAM Journal on Computing<\/em> <b>35<\/b> (2005), no. 3, 647\u2014657 (electronic).<\/li>\n \t<li style=\"background-color: #e2e2c7;\" title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2281\">Comparing DNR and WWKL<\/a> (with Klaus Ambos-Spies, Steffen Lempp, and Theodore A. Slaman). <em>Journal of Symbolic Logic<\/em> <b>69<\/b> (2004), no. 4, 1089\u20141104.<\/li>\n \t<li title=\"2006-12-18\"><a href=\"https:\/\/arxiv.org\/abs\/1408.3158\">Local initial segments of the Turing degrees<\/a>. <em>Bulletin of Symbolic Logic<\/em> <b>9<\/b> (2003), no. 1, 26\u201436.<\/li>\n<\/ol>\n<h4 id=\"conf\">Conference papers without a journal or book version yet<\/h4>\n<ol>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1408.1999\">The strength of the Besicovitch-Davies theorem<\/a> (with Jan Reimann), Computability in Europe, <em>Lecture Notes in Computer Science<\/em> <b>6158<\/b> (2010), 229\u2014238.<\/li>\n \t<li title=\"2010-02-10\"><a href=\"https:\/\/arxiv.org\/abs\/1408.2169\">Numberings and randomness<\/a> (with Katie Brodhead). Computability in Europe, <em>Lecture Notes in Computer Science<\/em> <b>5635<\/b> (2009), 49\u201458.<\/li>\n \t<li>Beros, Kjos-Hanssen, and Yogi: <a href=\"https:\/\/arxiv.org\/abs\/1902.00812\">Planar digraphs for automatic complexity<\/a>, <em>Lecture Notes in Computer Science<\/em> <strong>11436<\/strong> (2019), 59--73. TAMC 2019 (Theory and Applications of Models of Computation).<\/li>\n \t<li title=\"2010-02-10\">Kjos-Hanssen: <a href=\"https:\/\/arxiv.org\/abs\/0901.3949\">A rigid cone in the truth-table degrees with jump<\/a>, Downey Festschrift, <em>Lecture Notes in Computer Science<\/em> <b>10010<\/b> (2017), 487--500.<\/li>\n \t<li><span style=\"background-color: lightgray;\"><a href=\"https:\/\/arxiv.org\/abs\/1703.04878\">Superposition as memory: unlocking quantum automatic complexity<\/a>. <em>Lecture Notes in Computer Science<\/em> <strong>10240<\/strong> (2017), 160-169. Unconventional Computation and Natural Computation (UCNC) 2017.<\/span><\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/2104.13511\">KL-randomness and effective dimension under strong reducibility<\/a> (with David J. Webb). Computability in Europe, Lectures Notes in Computer Science <b>12813<\/b> (2021), 457--468.<\/li>\n \t<li><a href=\"http:\/\/arxiv.org\/abs\/2104.13322\">On the degrees of constructively immune sets<\/a> (with Samuel D. Birns). Computability in Europe, Lectures Notes in Computer Science <b>12813<\/b> (2021), 50--59.<\/li>\n \t<li>Bj\u00f8rn Kjos-Hanssen and David J. Webb. <a href=\"https:\/\/arxiv.org\/abs\/2204.13297\">Strong Medvedev reducibilities and the Kolmogorov-Loveland randomness problem<\/a>. <span style=\"background-color: lightgray;\">Lecture Notes in Computer Science <b>13359<\/b> (2022), 151--161, Computability in Europe 2022<\/span>.<\/li>\n<\/ol>\n<h3 id=\"arxiv\">arXiv only<\/h3>\n<ol>\n \t<li title=\"2012-07-26\"><a href=\"https:\/\/arxiv.org\/abs\/1207.6622\">Effective Banach spaces<\/a>, Master's thesis, Mathematics, University of Oslo, 1997.<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/1607.02189\">Models of the Chisholm set<\/a>, term paper for <em>Filosofi hovedfag spesialomr\u00e5de 1<\/em>, Fall 1996, University of Oslo.\nRelated work by Carmo and Jones:\n1. <a href=\"https:\/\/drive.google.com\/drive\/folders\/1rTYB14XfrGBHdk-9owrExBjU28h6JiXc?usp=sharing\">A new approach to contrary-to-duty obligations<\/a> (page 331 and onwards), published 1997.\n2. <a href=\"https:\/\/math.hawaii.edu\/~bjoern\/pdf\/JonesChnew.pdf\">Deontic logic and contrary-to-duties<\/a>, Handbook of Philosophical Logic, 2002 (see page 287 and on).\n3. <a href=\"https:\/\/math.hawaii.edu\/~bjoern\/pdf\/logcom.exs009.full copy.pdf\">Completeness and decidability results for a logic of contrary-to-duty conditionals<\/a>, 2013\n4. <a href=\"https:\/\/math.hawaii.edu\/~bjoern\/pdf\/carmo-jones-2022.pdf\">Carmo and Jones' logic for contrary-to-duty obligations revised<\/a>, 2022<\/li>\n \t<li><a href=\"https:\/\/arxiv.org\/abs\/0901.4180\">Google distance between words<\/a> (with Alberto J. Evangelista). Presented at <em>Frontiers in Undergraduate Research<\/em>, University of Connecticut, 2006.<\/li>\n<\/ol>\n<h3>Comment<\/h3>\nFor a lot more on the Turing automorphism problem by Slaman and Woodin, see their manuscript draft: <a href=\"https:\/\/math.berkeley.edu\/~slaman\/talks\/sw.pdf\">Slaman's copy<\/a>, <a href=\"https:\/\/math.hawaii.edu\/~bjoern\/pdf\/sw.pdf\">another copy<\/a>.\n<h3>Textbook<\/h3>\n<ol>\n \t<li>Kjos-Hanssen and Birns:\u00a0<a href=\"https:\/\/dspace.lib.hawaii.edu\/handle\/10790\/4572\">Statistics for Calculus Students<\/a>. \u00a0Open Education Resources (OER), Outreach College, University of Hawaii at Manoa, February 21, 2019. (<a href=\"http:\/\/hdl.handle.net\/10790\/4572\">Permalink<\/a>)<\/li>\n<\/ol>\n\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":7609128,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-2","page","type-page","status-publish","has-post-thumbnail","hentry"],"_links":{"self":[{"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/pages\/2","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/comments?post=2"}],"version-history":[{"count":749,"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/pages\/2\/revisions"}],"predecessor-version":[{"id":9098956,"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/pages\/2\/revisions\/9098956"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/media\/7609128"}],"wp:attachment":[{"href":"https:\/\/math.hawaii.edu\/wordpress\/bjoern\/wp-json\/wp\/v2\/media?parent=2"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}