Related papers: Feedback computability on Cantor space

The classification of separable operator spaces and systems is commonly believed to be intractable. We analyze this belief from the point of view of Borel complexity theory. On one hand we confirm that the classification problems for…

The definitions of replicable and completely replicable functions are intimately related to the Hecke operators for the modular group. We define the notions of "$(2+)$-replicable" and "completely $(2+)$-replicable" functions by considering…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…

We describe a method to perform functional operations on probability distributions of random variables. The method uses reproducing kernel Hilbert space representations of probability distributions, and it is applicable to all operations…

We show that any function in a Bergman space with exponential type weights admits a representation in terms of an infinite series of kernel functions.

Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

We define and study expansion problems on countable structures in the setting of descriptive combinatorics. We consider both expansions on countable Borel equivalence relations and on countable groups, in the Borel, measure and category…

This thesis addresses Pour-El and Richards' fourth question from their book "Computability in analysis and physics", concerning the relation between higher order recursion theory and computability in analysis. Among other things it is shown…

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

We extend the classical Mercer theorem to reproducing kernel Hilbert spaces whose elements are functions from a measurable space $X$into $\mathbb C^n$. Given a finite measure $\mu$ on $X$, we represent the reproducing kernel $K$ as…

It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…

We prove that for every uncountable cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$, the quasi-order of embeddability on the $\kappa$-space of $\kappa$-sized graphs Borel reduces to the embeddability on the $\kappa$-space of…

A compactly supported distribution is called invertible in the sense of Ehrenpreis-H\"ormander if the convolution with it induces a surjection from $\mathcal{C}^{\infty}(\mathbb{R}^{n})$ to itself. We give sufficient conditions for radial…

We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…

Let $n \in \mathbb{Z}_{\geq 3}$ be given. We prove Lebesgue-almost everywhere pointwise inversion formulae for the Siegel transforms in the geometry of numbers. These inversion formulae are quite general; for instance, they are valid for…

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…