Bjørn Kjos-Hanssen
Scholar

Bjørn Kjos-Hanssen

Google Scholar ID: b5dVN0MAAAAJ
Professor of Mathematics, University of Hawaii at Manoa
ComputabilityAutomataModal logicProof assistants
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
259
 
H-index
8
 
i10-index
4
 
Publications
20
 
Co-authors
0
 
Contact
CVOpen ↗
Publications
7 items
Quantum Černý complexity of binary words
2026
Cited
0
The exact asymptotic constant in the metric dimension of Jaccard space
2026
Cited
0
Exact versus unique nondeterministic automatic complexity
2026
Cited
0
Every string has probabilistic automatic complexity at most three
2026
Cited
0
Classification and deontic explosion for contrary-to-duty obligations
2026
Cited
0
Unbounded length minimal synchronizing words for quantum channels over qutrits
2026
Cited
0
Languages of Words of Low Automatic Complexity Are Hard to Compute
2025
Cited
0
Resume
Academic Achievements
  • Academic achievements include:
  • - Articles on arXiv.org
  • - Work in the field of computer science
  • - Teaching experience covering courses such as MATH 654, MATH 657, MATH 242, MATH 244, MATH 253A, MATH 372, MATH 373, MATH 471&472, MATH 472, MATH 480 Senior Seminar, MATH 480 Spring 2018, MATH 649B, MATH 672 (Spring 2014), etc.
Research Experience
  • Research projects include:
  • - Knot and link theory in protein folding models
  • - Marginis: Formal Marginalia
  • - Mathlib contributions
  • - Logic and Analysis Special Session (San Luis Obispo)
  • - "A new approach to contrary-to-duty obligations" characterized
Education
  • Degree, school, advisor, and time information not provided.
Background
  • Professor of Mathematics at the University of Hawaii at Manoa
  • Research interests: Computability theory, modal logic, knot and link theory in protein folding models, etc.
Miscellany
  • Developed the Complexity Guessing Game and the Complexity Option Game