Related papers: Dynamics and abstract computability: computing inv…
The ability to perform a universal set of quantum operations based solely on static resources and measurements presents us with a strikingly novel viewpoint for thinking about quantum computation and its powers. We consider the two major…
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…
Motivated by recent developments on random polymer models we propose a generalisation of reflected Brownian motion (RBM) in a polyhedral domain. This process is obtained by replacing the singular drift on the boundary by a continuous one…
While invariant measures are widely employed to analyze physical systems when a direct study of pointwise trajectories is intractable, e.g., due to chaos or noise, they cannot uniquely identify the underlying dynamics. Our first result…
This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the…
In this work, we are interested in characterizing typical (generic) dimensional properties of invariant measures associated with the full-shift system, $T$, in a product space whose alphabet is a countable set. More specifically, we show…
On the basis of an analysis of previous research, we present a generalized approach for measuring the difference of plans with an exemplary application to machine scheduling. Our work is motivated by the need for such measures, which are…
This paper delves into the problem of computing robust controlled invariants for monotone continuous-time systems, with a specific focus on lower-closed specifications. We consider the classes of state monotone (SM) and control-state…
Invariant ergodic measures for generalized Boole type transformations are studied using an invariant quasi-measure generating function approach based on special solutions to the Frobenius--Perron operator. New two-dimensional Boole type…
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic devices which have super-Turing power, one needs to…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We present some rigorous results on the absence of a wide class of invariant measures for dynamical systems possessing attractors. We then consider a generalization of the classical nonholonomic Suslov problem which shows how previous…
We consider the problem of computing the maximal invariant set of discrete-time black-box nonlinear systems without analytic dynamical models. Under the assumption that the system is asymptotically stable, the maximal invariant set…
Causality serves as an abstract notion of time for concurrent systems. A computation is causal, or simply valid, if each observation of a computation event is preceded by the observation of its causes. The present work establishes that this…
We consider iterated function systems (finite or countable), together with linear and continuous operators on Hilbert spaces, which enable us to construct Markov-type operators. Under suitable conditions, these Markov-type operators have…
We describe a framework in which is possible to develop and implement algorithms for the approximation of invariant measures of dynamical systems with a given bound on the error of the approximation. Our approach is based on a general…
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…
Given the significance of physical measures in understanding the complexity of dynamical systems as well as the noisy nature of real-world systems, investigating the stability of physical measures under noise perturbations is undoubtedly a…
The axiomatic theory of ordinary differential equations, owing to its simplicity, can provide a useful framework to describe various generalizations of dynamical systems. In this study, we consider how dynamical properties can be…