Related papers: Turing Degrees and Automorphism Groups of Substruc…

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

In this paper we study structural properties of LV-degrees of the algebra of collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. We construct atoms…

A mathematical concept is identified and analyzed that is implicit in the 2012 paper Turing Incomputable Computation, presented at the Alan Turing Centenary Conference (Turing-100, Manchester). The concept, called dynamic level sets, is…

We contribute to the program of extending computable structure theory to the realm of metric structures by investigating lowness for isometric isomorphism of metric structures. We show that lowness for isomorphism coincides with lowness for…

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…

We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…

We study a new class of infinite dimensional Lie algebras, which has important applications to the theory of integrable equations. The construction of these algebras is very similar to the one for automorphic functions and this motivates…

We consider Turing machines as actions over configurations in $\Sigma^{\mathbb{Z}^d}$ which only change them locally around a marked position that can move and carry a particular state. In this setting we study the monoid of Turing machines…

We introduce invertible subalgebras of local operator algebras on lattices. An invertible subalgebra is defined to be one such that every local operator can be locally expressed by elements of the inveritible subalgebra and those of the…

The aim of this paper is to study the group of isomorphism classes of torsors of finite flat group schemes of rank 2 over a commutative ring $R$. This, in particular, generalises the group of quadratic algebras (free or projective), which…

We work in a first-order setting where structures are spread out over a metric space, with quantification allowed only over bounded subsets. Assuming a doubling property for the metric space, we define a canonical {\em core} $\mathcal{J}$…

Topological defects play a fundamental role in the investigation of symmetries in quantum field theories. For conformal field theories in two space-time dimensions, it is possible to construct these defects using lattice models allowing…

We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…

Indexed monoidal algebras are introduced as an equivalent structure for self-dual compact closed categories, and a coherence theorem is proved for the category of such algebras. Turing automata and Turing graph machines are defined by…

We will review the main results concerning the automorphism groups of saturated structures which were obtained during the two last decades. The main themes are: the small index property in the countable and uncountable cases; the…

We characterize the isomorphism types of principal ideals of the Turing degrees below 0' that are lattices as the lattices with a Sigma-0-3 presentation, by showing that each Sigma-0-3 presentable bounded upper semilattice is isomorphic to…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

Different group structures which underline the integrable systems are considered. In some cases, the quantization of the integrable system can be provided with substituting groups by their quantum counterparts. However, some other group…

We study automorphic Lie algebras and their applications to integrable systems. Automorphic Lie algebras are a natural generalisation of celebrated Kac-Moody algebras to the case when the group of automorphisms is not cyclic. They are…