Related papers: Bounded time computation on metric spaces and Bana…
We prove an extrapolation of compactness theorem for operators on Banach function spaces satisfying certain convexity and concavity conditions. In particular, we show that the boundedness of an operator $T$ in the weighted Lebesgue scale…
We determine the boundedness and compactness of a large class of operators, mapping from general Banach spaces of holomorphic functions into a particular type of spaces of functions determined by the growth of the functions, or the growth…
We give a new proof of a characterization of the closeness of the range of a continuous linear operator and of the closeness of the sum of two closed vector subspaces of a Banach space. Then we state sufficient conditions for the closeness…
This paper proposes a thought experiment to search for efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: -- On Universal Turing Machines, a program's time complexity should be characterized as:…
We introduce a new technique for the efficient management of large sequences of multidimensional data, which takes advantage of regularities that arise in real-world datasets and supports different types of aggregation queries. More…
In this work, we establish the first separation between computation with bounded and unbounded space, for problems with short outputs (i.e., working memory can be exponentially larger than output size), both in the classical and the quantum…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…
A notable feature of the TTE approach to computability is the representation of the argument values and the corresponding function values by means of infinitistic names. Two ways to eliminate the using of such names in certain cases are…
Computation is commonly defined as the execution of abstract algorithms over symbolic representations, with physical systems treated as substrates that realise predefined operations. While effective for engineered machines, this separation…
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…
Large scale real number computation is an essential ingredient in several modern mathematical proofs. Because such lengthy computations cannot be verified by hand, some mathematicians want to use software proof assistants to verify the…
Approaches to signal representation and coding theory have traditionally focused on how to best represent signals using parsimonious representations that incur the lowest possible distortion. Classical examples include linear and non-linear…
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…
A moldable job is a job that can be executed on an arbitrary number of processors, and whose processing time depends on the number of processors allotted to it. A moldable job is monotone if its work doesn't decrease for an increasing…
In a recent paper of Benson and Symonds, a new invariant was introduced for modular representations of a finite group. An interpretation was given as a spectral radius with respect to a Banach algebra completion of the representation ring.…
We analyse the extent of possible computations following Hogarth in Malament-Hogarth (MH) spacetimes, and Etesi and N\'emeti in the special subclass containing rotating Kerr black holes. Hogarth had shown that any arithmetic statement could…
We present a new framework for assessing the power of measurement-based quantum computation (MBQC) on short-range entangled symmetric resource states, in spatial dimension one. It requires fewer assumptions than previously known. The…
The lack of a $p$-adic Haar measure causes many methods of traditional representation theory to break down when applied to continuous representations of a compact $p$-adic Lie group $G$ in Banach spaces over a given $p$-adic field $K$. For…
Bounded-rate multi-mode systems are hybrid systems that can switch among a finite set of modes. Its dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given bounded sets. Given…