We study the computability of the set of invariant measures of a computable dynamical system. It is known to be semicomputable but not computable in general, and we investigate which semicomputable simplices can be realized in this way. We prove that every semicomputable finite-dimensional simplex can be realized, and that every semicomputable finite-dimensional convex set is the projection of the set of invariant measures of a computable dynamical system. In particular, there exists a computable system having exactly two ergodic measures, none of which is computable. Moreover, all the dynamical systems that we build are minimal Cantor systems
We discuss some recent results related to the deduction of a suitable probabilistic model for the de...
Since A. M. Turing introduced the notion of computability in 1936, various theories of real number c...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
We consider the question of computing invariant measures from an abstract point of view. Here, compu...
summary:Using recent results on measure theory and algebraic geometry, we show how semidefinite prog...
International audienceWe consider the question of computing invariant measures from an abstract poin...
AbstractIn the general context of computable metric spaces and computable measures we prove a kind o...
htmlabstractIn this paper we consider the computation of reachable, viable and invariant sets for di...
Abstract. In the general context of computable metric spaces and com-putable measures we prove a kin...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
Several recent results have implemented a number of deterministic automata (finite-state, pushdown, ...
textabstractThe computation of reachable sets of nonlinear dynamic and control systems is an importa...
International audienceThe partially ordered set of compact intervals provides a convenient embedding...
In this article we develop a theory of computation for continuous mathematics. The theory is based o...
We discuss some recent results related to the deduction of a suitable probabilistic model for the de...
Since A. M. Turing introduced the notion of computability in 1936, various theories of real number c...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....
We study the computability of the set of invariant measures of a computable dynamical system. It is ...
We consider the question of computing invariant measures from an abstract point of view. Here, compu...
summary:Using recent results on measure theory and algebraic geometry, we show how semidefinite prog...
International audienceWe consider the question of computing invariant measures from an abstract poin...
AbstractIn the general context of computable metric spaces and computable measures we prove a kind o...
htmlabstractIn this paper we consider the computation of reachable, viable and invariant sets for di...
Abstract. In the general context of computable metric spaces and com-putable measures we prove a kin...
AbstractThe computation of reachable sets of nonlinear dynamic and control systems is an important p...
Several recent results have implemented a number of deterministic automata (finite-state, pushdown, ...
textabstractThe computation of reachable sets of nonlinear dynamic and control systems is an importa...
International audienceThe partially ordered set of compact intervals provides a convenient embedding...
In this article we develop a theory of computation for continuous mathematics. The theory is based o...
We discuss some recent results related to the deduction of a suitable probabilistic model for the de...
Since A. M. Turing introduced the notion of computability in 1936, various theories of real number c...
AbstractIn Computable Analysis each computable function is continuous and computably invariant, i.e....