Related papers: A generalization of Markov's approach to the conti…

For a stationary sequence that is regularly varying and associated we give conditions which guarantee that partial sums of this sequence, under normalization related to the exponent of regular variation, converge in distribution to a…

We provide a framework for speeding up algorithms for time-bounded reachability analysis of continuous-time Markov decision processes. The principle is to find a small, but almost equivalent subsystem of the original system and only analyse…

It is proved that the continuum hypothesis implies the existence of a group M containing a nonalgebraic unconditionally closed set, i.e., a set which is closed in any Hausdorff group topology on M but is not an intersection of finite unions…

In this paper the concept of a partial cone metric space is investigated, some continuity type theorems, and fixed point theorems of contractive mappings in this generalized setting are proved as well as some theorems related to topological…

In this paper, we consider certain topological properties along with certain types of mappings on these spaces defined by the notion of ideal convergence. In order to do that, we primarily follow in the footsteps of the earlier studies of…

We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…

This paper investigates continuity properties of value functions and solutions for parametric optimization problems. These problems are important in operations research, control, and economics because optimality equations are their…

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…

We investigate, and prove equivalent, effective versions of local connectivity and uniformly local arcwise connectivity for connected and computably compact subspaces of Euclidean space. We also prove that Euclidean continua that are…

Computing the rate-distortion function for continuous sources is commonly regarded as a standard continuous optimization problem. When numerically addressing this problem, a typical approach involves discretizing the source space and…

General Markov chains in an arbitrary phase space are considered in the framework of the operator treatment. Markov operators continue from the space of countably additive measures to the space of finitely additive measures. Cycles of…

We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…

We give necessary and sufficient conditions on a non-oscillatory curve in an o-minimal field such that, for any bounded definable function, the germ of the function on an initial segment of the curve can be continuously extended to a closed…

Sequence modeling with neural networks has lead to powerful models of symbolic music data. We address the problem of exploiting these models to reach creative musical goals, by combining with human input. To this end we generalise previous…

Until now, Computer Scientists have concerned themselves with identifying efficient algorithms for solving the general case of some problem -- that is finding one which performs well when the size of the input tends to infinity. In this…

We establish the equivalence of the analytic and probabilistic notions of subharmonicity in the framework of general symmetric Hunt processes on locally compact separable metric spaces, extending an earlier work of the first named author on…

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

We aim at characterizing viability, invariance and some reachability properties of controlled piecewise deterministic Markov processes (PDMPs). Using analytical methods from the theory of viscosity solutions, we establish criteria for…

The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to…