We first provide a framework to formalise infinite sequences of qubits as states of a suitable C*-algebra. Thereafter we introduce an analog of Martin-Löf's notion. We show that for classical bit sequences the two notions coincide. We also discuss quantum Kolmogorov complexity for finite sequences of qubits and its relationship to quantum Martin-Löf randomness. Finally we consider an effective version of the Shannon-McMillan-Breiman theorem in the quantum setting.
This is joint work with Volkher Scholz. Paper available at https://arxiv.org/abs/1709.08422.
In this work, we explore Peq, the degree structure generated by primitive recursive reducibility on punctual equivalence relations, i.e., primitive recursive equivalence relations with domain ω. We show that Peq has much structure, being a dense distributive lattice. This contrasts with all other known degree structures on equivalence relations. Finally, we use our analysis to investigate the online content of computably categorical equivalence structures and prove many elementary differences.
This is joint work with Nikolay Bazhenov, Keng Meng Ng, and Andrea Sorbi.
Joint work with Barbara Csima and Keng Meng Ng.
The isomorphism problem for a family of group actions asks whether two given elements of the universe belong to the same orbit under the action. Many isomorphism problems have NP-intermediate status. Another class of problems with NP-intermediate status are certain compressibility questions for Boolean functions, including the Minimum Circuit Size Problem (MCSP): Given a function table and an integer k, does there exist a circuit of size at most k that computes the function?
We develop an approach to establish reductions from isomorphism problems to compressibility problems that is inspired by the constant-round interactive proof system for the complement of Graph Isomorphism. The approach yields randomized polynomial-time reductions with zero-sided error from a broad class of isomorphism problems to the problem of compressibility by short efficient programs (known as MKTP).
This talk is based on joint work with Eric Allender, Joshua Grochow, Cris Moore, and Andrew Morgan; see here for the paper.
In this work, we consider the open and clopen Ramsey theorems (also known as Nash-Williams theorem). It is known that both the open and the clopen Ramsey theorem are equivalent to ATR0 over RCA0. However, if we move into the Weihrauch context, we will see that are several ways to phrase these principles as multivalued functions, and they exhibit very different behaviors. This is joint work with Alberto Marcone.
The majority of the talk will explain what flatness is, how it should be thought of, and how closely it relates to hypergraphs and Hrushovski's construction method. Model theory makes an appearance only in the second part, where I will share results pertaining to the specific family of geometries arising from Hrushovski's methods.