Related papers: A Galois connection between Turing jumps and limit…
Claims about recursive self-improvement in AI often slide from repeated internal revision to the possibility of qualitatively stronger capability without clearly distinguishing the underlying computational regimes. This paper gives a formal…
The computational efficiency of quantum mechanics can be defined in terms of the qubit circuit model, which is characterized by a few simple properties: each computational gate is a reversible transformation in a connected matrix group;…
The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (STOC 1993 and STOC 1994) provided a topological characterization of the tasks that are solvable in a distributed system where processes are communicating by writing…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
We consider heavy-tailed observables maximised on a dynamically defined Cantor set and prove convergence of the associated point processes as well as functional limit theorems. The Cantor structure, and its connection to the dynamics,…
We consider the scenario in which a set of sources generate messages in a network and a receiver node demands an arbitrary linear function of these messages. We formulate an algebraic test to determine whether an arbitrary network can…
This paper studies the class of logarithmically completely monotonic (LCM) functions. These functions play an important role in characterising externally positive linear systems which find applications in important control problems such as…
This work improves the existing central limit theorems (CLTs) for geometric functionals of Gibbs processes in three aspects. First, we derive a CLT for weakly stabilizing functionals, thereby improving on the previously used assumption of…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…
Reversibility is a key issue in the interface between computation and physics, and of growing importance as miniaturization progresses towards its physical limits. Most foundational work on reversible computing to date has focussed on…
We study the problem of approximately counting matchings in hypergraphs of bounded maximum degree and maximum size of hyperedges. With an activity parameter $\lambda$, each matching $M$ is assigned a weight $\lambda^{|M|}$. The counting…
The article contains an outline of a possible new direction for Computability Logic (see www.csc.villanova.edu/~japaridz/CL/ ), focused on computability without infinite memory or other impossible-to-possess computational resources. The new…
Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…
We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound $ o(\log(n)) $.
In the present article we describe a class of algebraic curves on which rational functions of two arguments may reach all their possible limiting values. We also solve a similar question for functions that can be represented as a uniform…
We answer two questions from {\it V.Bykov, On Baire class one functions on a product space, Topol. Appl. {199} (2016) 55--62,} and prove that every Baire one function on a subspace of a countable perfectly normal product is the pointwise…
We consider Betti numbers of the excursion of a smooth Euclidean Gaussian field restricted to a rectangular window, in the asymptotics where the window grows to R^d . With motivations coming from Topological Data Analysis, we derive a…
We describe a class calculus that is expressive enough to describe and improve its own learning process. It can design and debug programs that satisfy given input/output constraints, based on its ontology of previously learned programs. It…
We address a two-dimensional nonlinear elliptic problem with a finite-amplitude periodic potential. For a class of separable symmetric potentials, we study the bifurcation of the first band gap in the spectrum of the linear Schr\"{o}dinger…