Computable analysis with applications to dynamic systems

DOI10.1017/S096012952000002XzbMATH Open1478.03072OpenAlexW3012235450MaRDI QIDQ5220187FDOQ5220187

Pieter Collins

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

Recommendations

• New Computational Paradigms
• Recent development in rigorous computational methods in dynamical systems
• A tutorial on computable analysis
• Computability and dynamical systems
• Computability in analysis

zbMATH Keywords

computable analysisdynamic systemTuring machine

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Attainable sets, reachability (93B03) Topological spaces and generalizations (closure spaces, etc.) (54A05) Categorical methods in general topology (54B30) Constructive and recursive analysis (03F60) Topological methods (93B24)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Introduction to Interval Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Domain representations of topological spaces
• Effective computability of solutions of differential inclusions: the ten thousand monkeys approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Continuous Lattices and Domains
• AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The boundedness of all products of a pair of matrices is undecidable
• Title not available (Why is that?)
• The Spectral Theory of Distributive Continuous Lattices
• Spaces in which sequences suffice
• Comparing Cartesian closed categories of (core) compactly generated spaces
• A convenient category of domains
• Impulse differential inclusions: a viability approach to hybrid systems
• Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
• Title not available (Why is that?)
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Constructivism in mathematics. An introduction. Volume II
• Title not available (Why is that?)
• A computer-verified monadic functional implementation of the integral
• Continuity and computability of reachable sets
• Semantics and Computability of the Evolution of Hybrid Systems
• On the definitions of computable real continuous functions
• Title not available (Why is that?)
• Function spaces and adjoints.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Synthetic topology: of data types and classical spaces
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
• Computability on subsets of metric spaces.
• Title not available (Why is that?)
• A fundamental effect in computations on real numbers
• Computational effects in topological domain theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theorie der Numerierungen I
• Approximation of the viability kernel
• A domain-theoretic approach to computability on the real line
• Extended admissibility.
• Theory and Applications of Models of Computation
• Title not available (Why is that?)
• A computable approach to measure and integration theory
• A Direct Proof of the Hofmann-Mislove Theorem
• Elementary computable topology
• Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach
• Theorie Der Numerierungen III
• A Real Number Structure that is Effectively Categorical
• Title not available (Why is that?)
• Markov's constructive analysis; a participant's view
• Continuous selection of the solution map for one-sided Lipschitz differential inclusions
• Computations via Newtonian and relativistic kinematic systems
• Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
• Descriptive Set Theory in the Category of Represented Spaces
• On the topological aspects of the theory of represented spaces
• Optimal semicomputable approximations to reachable and invariant sets
• An Introduction to the Verification of Hybrid Systems Using Ariadne
• Partial Continuous Functions and Admissible Domain Representations
• Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer

Cited In (14)

• On envelopes and backward approximations
• Characterizing Computable Analysis with Differential Equations
• Title not available (Why is that?)
• Computer algebra methods for implicit dynamic systems and applications
• An application of computer algebra and dynamical systems
• Computer assisted proofs in dynamical systems
• Robust Computations with Dynamical Systems
• A computable and compositional semantics for hybrid systems
• Title not available (Why is that?)
• Computing with continuous-time Liapunov systems
• Computation with perturbed dynamical systems
• On the computability of the set of automorphisms of the unit square
• Title not available (Why is that?)
• Some applications of computers to the investigation of substitutional dynamical systems.

Uses Software

• PNM
• Ariadne

This page was built for publication: Computable analysis with applications to dynamic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220187)