Category Archives: research

pic-CTFM
research

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

Leave a comment

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

LFSR_Fibonacci_8_bits
research

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.

london1
conferences, research

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

image-heidelberg
research

On the complexity of automatic complexity

Leave a comment

The paper “On the complexity of automatic complexity” is to appear in Theory of Computing Systems, in a post-conference journal issue for Computability, Complexity and Randomness 2015 held in Heidelberg, Germany.

While it is not known whether the set of strings of maximal nondeterministic automatic complexity is NP-complete (hence the paper is called “On the complexity…” rather than just “The complexity…”), the paper shows that the more general problem for automatic complexity of equivalence relations is NP-complete. It is also shown that the set of highly complex strings is not context-free.

2326007202794064150-account_id=1
conferences, research

Superposition as memory @ UCNC17

Leave a comment

Imagine a lock with two states, locked and unlocked, which may be manipulated using two operations, called 0 and 1. Moreover, the only way to (with certainty) unlock using four operations is to do them in the sequence 0011, i.e., $0^n1^n$ where $n=2$. In this scenario one might think that the lock needs to be in certain further states after each operation, so that there is some memory of what has been done so far. Here we show that this memory can be entirely encoded in superpositions of the two basic states locked and unlocked, where, as dictated by quantum mechanics, the operations are given by unitary matrices. Moreover, we show using the Jordan–Schur lemma that a similar lock is not possible for $n=60$.

Details in the paper: Superposition as memory: unlocking quantum automatic complexity which appeared in the Lecture Notes in Computer Science volume of the conference Unconventional Computation and Natural Computation (UCNC) 2017.

Slides

group
research

Computability Theory List Server

2 Comments

As of June 15, 2006, we are not posting emails for ANY third party. To post one must be a subscriber to the list. If you are having problems first confirm yourself as subscriber (directions are below) and if that does not work please remove yourself from the list and resubscribe. Directions on how to do this can be found by following the links below.

To use the list just send email to comp-thy@lists.hawaii.edu, the list server will take care of the rest. You must be a member of the list to send mail to the list. Anyone is free to join the list. Use the list just as you would a normal email address expect for the fact that everyone subscribed to the list will receive a copy of your email. It may take some time before your message reaches everyone on the list. You may use the list as you see fit.

Although it would be best if it were used for short announcements of interest to all computability theorists.

A WORD OF CAUTION: Large files cause problems for many mailers.

Using the list server

The list server at University of Hawaii maintains the mailing list. It can do many things. For example, it can be used to subscribe, unsubscribe, or look at the archive for the list. These and others tasks are completed by issuing commands to the list server. The easiest way to do this is do use the WWW interface at listserv.hawaii.edu.

Note only COMP-THY subscribers may access the list archives. When you attempt to access the archives, you will be asked for your email address and a password. If you already have a password for listserv.hawaii.edu, use that password to access the COMP-THY list. If you do not have a password for listserv.hawaii.edu, go to listserv.hawaii.edu to sign up.