Related papers: A Galois connection between Turing jumps and limit…
We prove functional limit theorems for dynamical systems in the presence of clusters of large values which, when summed and suitably normalised, get collapsed in a jump of the limiting process observed at the same time point. To keep track…
Given a family of continuous real functions $\mathcal{G}$, let $R_\mathcal{G}$ be a binary relation defined as follows: a continuous function $f\colon\mathbb{R}\to\mathbb{R}$ is in the relation with a closed set $E\subseteq\mathbb{R}$ if…
In order to obtain functional limit theorems for heavy tailed stationary processes arising from dynamical systems, one needs to understand the clustering patterns of the tail observations of the process. These patterns are well described by…
We study the basic Galois connection induced by the "satisfaction" relation between external operations $A^n\rightarrow B$ defined on a set $A$ and valued in a possibly different set $B$ on the one hand, and ordered pairs $(R,S)$ of…
Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation. We study the probability that the machine will produce a…
We develop synthetic notions of oracle computability and Turing reducibility in the Calculus of Inductive Constructions (CIC), the constructive type theory underlying the Coq proof assistant. As usual in synthetic approaches, we employ a…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
Functionals are an important research subject in Mathematics and Computer Science as well as a challenge in Information Technologies where the current programming paradigm states that only symbolic computations are possible on higher order…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
We develop the foundations of effective ultraproducts of fields and their Galois groups using the methods of computability theory. These computability-theoretic analogs of ultraproducts are called cohesive products, since the role of an…
We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and we give bounds for the degrees of their coordinate…
Tackling semi-supervised learning problems with graph-based methods has become a trend in recent years since graphs can represent all kinds of data and provide a suitable framework for studying continuum limits, e.g., of differential…
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…
If the no-signalling principle was the only limit to the strength of non-local correlations, we would expect that any form of no-signalling correlation can indeed be realized. That is, there exists a state and measurements that remote…
Programs with control are usually modeled using lambda calculus extended with control operators. Instead of modifying lambda calculus, we consider a different model of computation. We introduce continuation calculus, or CC, a deterministic…
In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…
Common definitions of the "standard" LOCAL model tend to be sloppy and even self-contradictory on one point: do the nodes update their state using an arbitrary function or a computable function? So far, this distinction has been safe to…
We introduce a new type of closure operator on the set of relations, max-implementation, and its weaker analog max-quantification. Then we show that approximation preserving reductions between counting constraint satisfaction problems…
Partiality is a natural phenomenon in computability that we cannot get around. So, the question is whether we can give the areas where partiality occurs, that is, where non-termination happens, more structure. In this paper we consider…