Related papers: How incomputable is the separable Hahn-Banach theo…
An infinite binary sequence A is absolutely undecidable if it is impossible to compute A on a set of positions of positive upper density. Absolute undecidability is a weakening of bi-immunity. Downey, Jockusch and Schupp asked whether,…
To any solution of a linear system of differential equations, we associate a kernel, correlators satisfying a set of loop equations, and in presence of isomonodromic parameters, a Tau function. We then study their semiclassical expansion…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for…
We prove the computability of a version of Whitney Extension, when the input is suitably represented. More specifically, if $F \subseteq \mathbb{R}^n$ is a closed set represented so that the distance function $x \mapsto d(x,F)$ can be…
We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
In a minimal binary constraint network, every tuple of a constraint relation can be extended to a solution. The tractability or intractability of computing a solution to such a minimal network was a long standing open question. Dechter…
We consider the problem of determining the complexity of the uniform homeomorphism relation between separable Banach spaces in the Borel reducibility hierarchy of analytic equivalence relations. We prove that the complete $K_{\sigma}$…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
Church's thesis claims that all effecticely calculable functions are recursive. A shortcoming of the various definitions of recursive functions lies in the fact that it is not a matter of a syntactical check to find out if an entity gives…
We introduce kernel-summability methods in Banach spaces using the vector-valued integrals and prove an analogue of the Silverman-Toeplitz Theorem for regular kernel-summability methods. We also show that if $X$ is a Banach space and one…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
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…
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only…
We obtain a decomposition for the Hochschild cochain complex of a split algebra and we study some properties of the cohomology of each term of this decomposition. Then, we consider the case of trivial extensions, specially of Frobenius…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…
Let $\mathcal{K}=(K,v,\ldots)$ be a dp-minimal expansion of a non-trivially valued field of characteristic $0$ and $\mathcal{F}$ an infinite field interpretable in $\mathcal{K}$. Assume that $\mathcal{K}$ is one of the following: (i)…