Martin-Löf (1966) formalised the intuitive notion of randomness for infinite sequences of bits via algorithmic tests. What if we replace classical bits by quantum bits?

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.

The complexity of equivalence relations received much attention in the literature. In general, a reduction of an equivalence relation R on X to an equivalence relation S on Y is a function f: X → Y that injectively maps R-classes to S-classes. In descriptive set theory, one assumes that X and Y are Polish spaces and f is Borel. In computability theory, one assumes that X=Y=ω and f is computable. To compare the complexity of equivalence relations which are computable, researchers also considered feasible variants of computable reducibility, such as the polynomial-time reducibility.

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.

The Kreisel Basis Theorem says that each Π⁰₁-class has a member of c.e. Turing degree. What collections of c.e. degrees can be realized as exactly the c.e. members of some Π⁰₁-class? For example, using a Π⁰₁-class of Martin-Löf random sets, we see that we can realize the collection of Turing complete c.e. sets, and old work of Jockusch and Soare shows that {e | W_e incomplete and noncomputable} cannot be realized in a single Π⁰₁-class. Clearly, realizable collections will be index sets. We give a complete (and perhaps surprising) answer to this question, and also introduce a new notion of a representation of an index set.

Joint work with Barbara Csima and Keng Meng Ng.

We will study punctual (primitive recursive) algorithms on the structures. In particular, I will give a model-theortic description for intristically primitive recursive sets for algebraic structures. Also, we will study the relative categoricity on a cone and its effective and non-effective characterizations. The results obtained jointly with A. Melnikov and A. Montalbán.

We investigate analogs of the theory of effectively inseparable pairs of recursively enumerable sets to Π¹₁-sets of numbers and Π¹₁-sets of reals. These are used to derive completeness results, such as an unpublished result of Harrington about jump hierarchies.

Whereas NP-complete problems are polynomial-time reducible to each other by definition, little is known about reductions between well-known candidate NP-intermediate problems. In this talk, we present reductions between two types of such problems: isomorphism problems and compressibility problems.

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.

While the lower levels of the Weihrauch lattice have been extensively studied, the higher levels remain mostly unexplored. Recently, in a Dagstuhl meeting, Marcone raised the question about what the Weihrauch hierarchy looks like if we consider principles that are at the level of ATR₀ or Π¹₁-CA₀. This started the quest for an "ATR₀-analogue" in the Weihrauch lattice.

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 ATR₀ over RCA₀. 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.

In model theory, the tamest of structures are the strongly minimal ones - those in which every equation in a single variable has either finitely many or cofinitely many solutions. Algebraically closed fields and vector spaces are the canonical examples. Zilber’s conjecture, later refuted by Hrushovski, states that the source of geometric complexity in a strongly minimal structure must be algebraic. The property of "flatness" (strict gammoid) of a geometry (matroid) is that which guarantees Hrushovski's construction is devoid of any associative structure.

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.

Intuitionistic logic is broadly accepted as the constructive logic. Its justification through a proof interpretation is not. We present aspects of the arguments for one or the other version of a proof interpretation for constructive logic.

It is an old theorem that if a regular cardinal κ is singularized to countable cofinality, while preserving cardinals, then ◻κω holds in the outer model. Many strengthenings of this theorem have been obtained as well. We prove that this does not generalize to uncountable cofinalities. We show that after the right kind of preparation, in the Magidor model of singularizing κ to uncountable cofinality (and so while preserving cardinals), all intermediate forms of square at κ fail. This is another instance of the familiar phenomenon that singular cardinals of countable cofinality can behave quite differently than those of uncountable cofinality. This is joint work with Maxwell Levine.

TBA

TBA

TBA

TBA

TBA

TBA