Related papers: Weihrauch-completeness for layerwise computability
We study a family of integrable systems of nonlinearly coupled harmonic oscillators on the classical and quantum levels. We show that the integrability of these systems follows from their symmetry characterized by algebras called here…
We prove that the classical integrability condition for almost complex structures on finite-dimensional smooth manifolds also works in infinite dimensions in the case of almost complex structures that are real analytic on real analytic…
Schr\"odinger operators with periodic (possibly complex-valued) potentials and discrete periodic operators (possibly with complex-valued entries) are considered, and in both cases the computational spectral problem is investigated: namely,…
This document provides a formal proof of Birkhoff's completeness theorem for multi-sorted algebras which states that any equational entailment valid in all models is also provable in the equational theory. More precisely, if a certain…
We show the existence and orthogonality of wave operators naturally associated to a compatible Laplacian on a complete manifold with a corner of codimension 2. In fact, we prove asymptotic completeness i.e. that the image of these wave…
In this short note, we establish an operator theoretic version of the Wiener-Ikehara tauberian theorem, and point out how this leads to a new proof of the Prime number theorem that should be accessible to anyone with a basic knowledge of…
In this paper we study a cohomology theory of compatible Leibniz algebra. We construct a graded Lie algebra whose Maurer-Cartan elements characterize the structure of compatible Leibniz algebras. Using this, we study cohomology,…
We explain why the conventional argument for deriving the time-dependent Born-Oppenheimer approximation is incomplete and review recent mathematical results, which clarify the situation and at the same time provide a systematic scheme for…
We study Birkhoff-James orthogonality of bounded linear operators on complex Banach spaces and obtain a complete characterization of the same. By means of introducing new definitions, we illustrate that it is possible in the complex case,…
We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…
This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…
We prove that the problem of determining whether a finite logical matrix determines an algebraizable logic is complete for EXPTIME. The same result holds for the classes of order algebraizable, weakly algebraizable, equivalential and…
We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…
In computable analysis typically topological spaces with countable bases are considered. The Theorem of Kreitz-Weihrauch implies that the subbase representation of a second-countable $T_0$ space is admissible with respect to the topology…
We give results and observations which allow the application of the logarithmic tensor category theory of Lepowsky, Zhang and the author ([HLZ1]--[HLZ9]) to more general vertex (operator) algebras and their module categories than those…
Let $H$ be a reflexive, dense, separable, infinite dimensional complex Hilbert space and let $B(H)$ be the algebra of all bounded linear operators on $H$. In this paper, we carry out characterizations of norm-attainable operators in normed…
We propose a detailed proof of the fact that the inverse of Ackermann function is computable in linear time.
We construct a Heisenberg-like algebra for the one dimensional infinite square-well potential in quantum mechanics. The ladder operators are realized in terms of physical operators of the system as in the harmonic oscillator algebra. These…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
In this paper we study the interaction between logic and probability. In particular, we show that the convex hull of evaluations of a broad class of logics is always effectively axiomatizable. We define a Birkhoff-style calculus for…