Computable analysis with applications to dynamic systems
From MaRDI portal
Publication:5220187
DOI10.1017/S096012952000002XzbMath1478.03072OpenAlexW3012235450MaRDI QIDQ5220187
Publication date: 11 March 2020
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s096012952000002x
Constructive and recursive analysis (03F60) Topological spaces and generalizations (closure spaces, etc.) (54A05) Categorical methods in general topology (54B30) Attainable sets, reachability (93B03) Computation over the reals, computable analysis (03D78) Topological methods (93B24)
Related Items
On the computability of the set of automorphisms of the unit square ⋮ On envelopes and backward approximations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
- Continuous selection of the solution map for one-sided Lipschitz differential inclusions
- A computer-verified monadic functional implementation of the integral
- A computable approach to measure and integration theory
- Computations via Newtonian and relativistic kinematic systems
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
- Constructivism in mathematics. An introduction. Volume II
- A fundamental effect in computations on real numbers
- A domain-theoretic approach to computability on the real line
- Markov's constructive analysis; a participant's view
- Approximation of the viability kernel
- Reachability analysis of dynamical systems having piecewise-constant derivatives
- Computability on subsets of metric spaces.
- The boundedness of all products of a pair of matrices is undecidable
- Domain representations of topological spaces
- Extended admissibility.
- Comparing Cartesian closed categories of (core) compactly generated spaces
- Continuity and computability of reachable sets
- Optimal semicomputable approximations to reachable and invariant sets
- A Convenient Category of Domains
- Semantics and Computability of the Evolution of Hybrid Systems
- On the definitions of computable real continuous functions
- Introduction to Interval Analysis
- Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
- Theorie der Numerierungen I
- Function spaces and adjoints.
- Theorie Der Numerierungen III
- The Spectral Theory of Distributive Continuous Lattices
- A Real Number Structure that is Effectively Categorical
- A Direct Proof of the Hofmann-Mislove Theorem
- An Introduction to the Verification of Hybrid Systems Using Ariadne
- Descriptive Set Theory in the Category of Represented Spaces
- Continuous Lattices and Domains
- AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
- Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
- Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer
- Impulse differential inclusions: a viability approach to hybrid systems
- Spaces in which sequences suffice
- Partial Continuous Functions and Admissible Domain Representations
- On the topological aspects of the theory of represented spaces
- Theory and Applications of Models of Computation
