Related papers: Bounded time computation on metric spaces and Bana…

Building on our prior work on axiomatization of exact real computation by formalizing nondeterministic first-order partial computations over real and complex numbers in a constructive dependent type theory, we present a framework for…

Let $p\in(0, 1]$. In this paper, the authors prove that a sublinear operator $T$ (which is originally defined on smooth functions with compact support) can be extended as a bounded sublinear operator from product Hardy spaces $H^p({{\mathbb…

A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…

Models of computations over the integers are equivalent from a computability and complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete-time models over the reals. The situation is unclear but…

Recently we introduced a class of number representations denoted RN-representations, allowing an un-biased rounding-to-nearest to take place by a simple truncation. In this paper we briefly review the binary fixed-point representation in an…

We study order-to-weak continuous operators from an ordered Banach space to a normed space. It is proved that under rather mild conditions every order-to-weak continuous operator is bounded.

In a recent paper, two multi-representations for the measurable sets in a computable measure space have been introduced, which prove to be topologically complete w.r.t. certain topological properties. In this contribution, we show them…

Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…

In this paper, we extend the Banach contraction principle to metric-like as well as partial metric spaces (not essentially complete) equipped with an arbitrary binary relation. Thereafter, we derive some fixed point results which are…

This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently…

Sequence representations supporting queries $access$, $select$ and $rank$ are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such representations, and how…

This paper is a contribution to the theory of dynamical sampling. Our purpose is twofold. We first consider representations of sequences in a Hilbert space in terms of iterated actions of a bounded linear operator. This generalizes recent…

The theory of imprecise Markov chains has achieved significant progress in recent years. Its applicability, however, is still very much limited, due in large part to the lack of efficient computational methods for calculating…

We investigate the extrinsic geometry of causal sets in $(1+1)$-dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in…

Recent work on the representation of functions on sets has considered the use of summation in a latent space to enforce permutation invariance. In particular, it has been conjectured that the dimension of this latent space may remain fixed…

We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider…

Computations, where the number of results is much smaller than the input data and are produced through some sort of accumulation, are called Reductions. Reductions appear in many scientific applications. Usually, reductions admit an…

Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…

We present a combination of the Mixed-Echelon-Hermite transformation and the Double-Bounded Reduction for systems of linear mixed arithmetic that preserve satisfiability and can be computed in polynomial time. Together, the two…

The relativistic theory of unconstrained $p$-dimensional membranes ($p$-branes) is further developed and then applied to the embedding model of induced gravity. Space-time is considered as a 4-dimensional unconstrained membrane evolving in…