Humuhumunukunukuapua’a at the Symposium

2nd Annual SURE Symposium 2019

SURE: Summer Undergraduate Research Experience

will feature two projects mentored by Prof. Kjos-Hanssen:

VC-dimensions of nondeterministic finite automata for words of equal length

Davin Takahashi and Ethan Lamb

Ishigami and Tani studied VC-dimensions of finite automata. We show that their results apply to a new notion, lower VC-dimension, where all sets (instead of some set) of a given cardinality must be shattered. We also relate the VC-dimension to the Separating Words problem.

Savings from word powers in automatic complexity

Sun Young Kim and Clyde Felix

The automatic complexity of a word was introduced by Shallit and Wang in 2001 and studied further by Kjos-Hanssen since 2013. In this work we develop an implementation of a lower bound on the complexity involving occurrences of powers of words, such as the occurrence of “humu” twice in “humuhumunukunukuapua’a”.

Permutations of the integers and Aut($\mathcal D_T$)

Two papers on restrictions on automorphisms of Turing and truth-table degrees appeared in the Downey Festschrift for the Computability and Complexity Symposium 2017 in honour of Rod Downey’s 60th birthday.

One, “Permutations of the integers induce only the trivial automorphism of the Turing degrees”, appeared in Bulletin of Symbolic Logic (2018), and was presented at Workshop on Computability Theory in Waterloo, Ontario, and Workshop on Computability Theory and Foundations of Mathematics (CTFM) in Tokyo.

Slides for Waterloo/Tokyo

Slides for Singapore 2019

Automatic Complexity 2014-2019

The Simons Foundation under the program Collaboration Grants for Mathematicians (#315188 to Bjørn Kjos-Hanssen, grant title “Automatic Complexity”) supported my travel during 2014–2019.

Year Trips
2014 – 2015 COCOA 2014 (Maui); U. Washington; Varieties of Algorithmic Information; CCR, Heidelberg; Haidar to Arizona Winter School
2015 – 2016 ASL Annual Meeting, UConn (myself and Beros); SIAM Meeting on Discrete Math, Atlanta
2016 – 2017 WoLLIC, London; UCNC, Arkansas
2017 – 2018 Workshop on Computability Theory, Waterloo
2018 – 2019 Computability Theory and Foundations of Mathematics, Tokyo; Joint Math Meetings, Baltimore

Nine subprojects

Here are papers produced about automatic complexity, many with Master’s students.
Conferences in parentheses are those with no published proceedings.
Students or consultants in parentheses discussed the topic but were not coauthors.

Student/consultant Conference Journal
Hyde (MA, 2013) COCOON 2014 Elec. J. Combinatorics (2015)
COCOA 2014 Theoretical Computer Science (2015)
Alikhani (MA, 2014); Pakravan, Saadat (MSc Fin.Eng., 2013) Algorithmic Finance (2015)
(written at CCR 2015) Theory of Computing Systems (2017)
(Castiglione 2015) WoLLIC 2017 Discrete Mathematics (2018)
(Kobayashi 2016) (VAI 2015) Experimental Mathematics (2019)
(Huggins 2016) UCNC 2017
Liu (MA, 2017) (ALH 2018)
Yogi (MA, 2018)

For instance, I gave a talk in the Seattle Probability Seminar organized by Soumik Pal and Chris Burdzy at the University of Washington Department of Mathematics.

Title:
Kolmogorov structure functions for automatic complexity

Abstract:

We study an analogue of Kolmogorov’s notion of structure function, introduced in 1973, with Kolmogorov complexity replaced by Shallit and Wang’s (2001) automatic complexity. We discuss the prospects for using it for model selection in statistics. We prove an upper bound which is piecewise smooth, related to the binary entropy function, and appears to be fairly sharp based on numerical evidence.

The paper is loosely coupled with the following software:
– Complexity Guessing Game
– Complexity Option Game
– Structure Function Calculator
These are gathered in some slides.com slides.

Shift registers fool finite automata @ WoLLIC and in Discrete Mathematics

LFSRs (linear feedback shift registers) are popular pseudorandomness generators.
In a new project we show that they generate output (often called $m$-sequences) of maximal (nondeterministic path-based) automatic complexity. At this point we have an experimental result, one which would have probability $2^{-93}$ to occur “by chance”, as well as a theoretical but sub-optimal result.

Moreover, an $m$-sequence of length 31 provides an example of a word $x$ such that
$$
A^-(x)=A_N(x)+2
$$
where $A_N$ is nondeterministic path-based automatic complexity, and $A^-$ is non-total deterministic automatic complexity.
Such an example (where $A^-(x)-A_N(x)>1$) was not known before the consideration of LFSRs in this area. That consideration was an idea of Jason Castiglione.

The paper has been accepted at WoLLIC 2017 and in journal form for Discrete Mathematics (2018).

This project was presented at the poster session of the SIAM Conference on Discrete Mathematics 2016 in Atlanta, Georgia. The session was otherwise dominated by interesting work on RNA pseudoknots and chord diagrams (3 out of 6 posters) which in the case of the work of the Biocomplexity Institute researchers Ricky Chen and Thomas Li involves modeling with multiply context-free grammars.

WoLLIC 2017 slides