Related papers: Weihrauch-completeness for layerwise computability
Some integration techniques for real-valued functions with respect to vector measures with values in Banach spaces (and viceversa) are investigated in order to establish abstract versions of classical theorems of Probability and Stochastic…
We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…
A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…
We proove a Bloch's theorem in an almost complex projective plane.
The algebraic structure of iterated integrals has been encoded by Chen. Formally, it identifies with the shuffle and Lie calculus of Lyndon, Ree and Sch\"utzenberger. It is mostly incorporated in the modern theory of free Lie algebras.…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
Given a real-valued phase-space function, it is a nontrivial task to determine whether it corresponds to a Wigner distribution for a physically acceptable quantum state. This topic has been of fundamental interest for long, and in a modern…
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are…
By the sometimes so-called MAIN THEOREM of Recursive Analysis, every computable real function is necessarily continuous. Weihrauch and Zheng (TCS'2000), Brattka (MLQ'2005), and Ziegler (ToCS'2006) have considered different relaxed notions…
In this work we construct logarithms and Birkhoff normal forms for elliptic Fourier integral operators in the semi-classical limit under more general assumptions than in aprevious work by the first author. The methods are similar but…
We give two natural definitions of polynomial-time computability for L2 functions; and we show them incomparable (unless complexity class FP_1 includes #P_1).
We introduce a class of iterated logarithmic Lipschitz spaces $\mathcal{L}^{(k)}$, $k\in\mathbb{N}$, on an infinite tree which arise naturally in the context of operator theory. We characterize boundedness and compactness of the…
By means of fixed point index theory for multi-valued maps, we provide an analogue of the classical Birkhoff--Kellogg Theorem in the context of discontinuous operators acting on affine wedges in Banach spaces. Our theory is fairly general…
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
In the framework of geometric quantization we extend the Bohr-Sommerfeld rules to a full quantization theory which resembles Heisenberg's matrix theory. This extension is possible because Bohr-Sommerfeld rules not only provide an orthogonal…
We answer the following question posed by Lechuga: Given a simply-connected space $X$ with both $H_*(X,\qq)$ and $\pi_*(X)\otimes \qq$ being finite-dimensional, what is the computational complexity of an algorithm computing the cup-length…
A version of the Law of the Iterated Logarithm for smooth functions in the upper-half space is proved. As a consequence, we show that certain size conditions on the gradient and the gradient of the laplacian of a smooth function, lead to…
The polylogarithmic time hierarchy structures sub-linear time complexity. In recent work it was shown that all classes $\tilde{\Sigma}_{m}^{\mathit{plog}}$ or $\tilde{\Pi}_{m}^{\mathit{plog}}$ ($m \in \mathbb{N}$) in this hierarchy can be…