Lei Liu completed her Master’s degree with the project title Complexity of Options in 2017.
An extension to monotone options (pictured) was presented at
ALH-2018. The new paper is called The number of languages with maximum state complexity and has been accepted for TAMC 2019.
As of 2022, the paper has been through 7 revisions and has been accepted for publication in the journal Algebra Universalis.
Some of the 168 monotone Boolean functions of 4 variables
I gave a talk in the online seminar “Computability Theory and Applications” on November 17, 2020, on
Normalized Information Distance and Jaccard distance
The paper, with Niraula and Yoon, was published in Logical Foundations of Computer Science
Three new papers
with graduate students Birns (left) and Webb (right).
- KL-randomness and effective dimension under strong reducibility (with David J. Webb). Computability in Europe, Lectures Notes in Computer Science, 2021.
- On the degrees of constructively immune sets (with Samuel D. Birns). Computability in Europe, Lectures Notes in Computer Science, 2021.
- Strong Medvedev reducibilities and the KL-randomness problem (with David J. Webb). Computability in Europe, Lectures Notes in Computer Science, 2022.
I was the discussant for the following paper at Hawaii Accounting Research Conference 2020 on the UH Hilo campus:
The Contract Disclosure Mandate and Earnings Management under External Scrutiny
by Carlos Corona and Tae-Wook Ryan Kim
I learned that research in the Theory Track of the accounting discipline primarily is about mathematical modeling of the effects of government policies and business decisions. It borrows methods from economics for such modeling. In the case of the Corona-Kim paper: quadratic programming without constraints, and exponential utility functions. Usually these are not empirical papers, i.e., they don’t test the model explicitly against data. Indeed this would be hard to do with notions like “intensity of scrutiny”.
I am a discussant for “A theory of principles-based classification” by Konvalinka, Penno, and Stecher, at HARC 2021.
This new 42,000 USD grant from the Simons Foundation will support travel and collaboration during 2020-2025.
Pictured: Angsheng Li announcing TAMC 2020 in Changsha, China during TAMC 2019 in Kitakyushu, Japan.
This $7,705 grant from Decision Research Corporation will support work by undergraduate students, a grad student, and PI in their work on the automatic complexity of Fibonacci arrays, while exchanging knowledge between industry and the University.
Please watch this space for more information.