Related papers: Computational Dynamical Systems
In this paper we study the general concept of integrability in the broad sense within the frame of differential Galois theory. We concentrate on the gradient systems which are not integrable. In spite of it, if we consider them as the real…
We discuss the simulation of a complex dynamical system, the so-called quantum sawtooth map model, on a quantum computer. We show that a quantum computer can be used to efficiently extract relevant physical information for this model. It is…
The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church-Turing computability), non-inductive and…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…
Modern engineering systems include many components of different types and functions. Verifying that these systems satisfy given specifications can be an arduous task, as most formal verification methods are limited to systems of moderate…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
System and synthetic biology are rapidly evolving systems, but both lack tools such as those used in engineering environments to shift the their focus from the design of parts (details) to the design of systems (behaviors); to aggravate,…
Complex Systems were identified and studied in different fields, such as physics, biology, and economics. These systems exhibit exciting properties such as self-organization, robust order, and emergence. In recent years, software systems…
There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…
This paper is a survey of extensions to finite automata theory to model real-time systems as well as systems exhibiting mixed discrete-continuous behavior. Real-time systems maintain a continuous and timely interaction with the environment,…
The qualitatively new concept of dynamic complexity in quantum mechanics is based on a new paradigm appearing within a nonperturbational analysis of the Schroedinger equation for a generic Hamiltonian system. The unreduced analysis…
Dynamic properties of fermionic systems, like contollability, reachability, and simulability, are investigated in a general Lie-theoretical frame for quantum systems theory. Observing the parity superselection rule, we treat the fully…
This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…
This work presents a framework for control theory based on constructive analysis to account for discrepancy between mathematical results and their implementation in a computer, also referred to as computational uncertainty. In control…
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…
Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…
An integrable anharmonic oscillator is presumably simulable by a classical computer and therefore by a quantum computer. An integrable anharmonic oscillator whose Hamiltonian is of normal type and quartic in the canonical coordinates is not…
Whereas the importance of transient dynamics to the functionality and management of complex systems has been increasingly recognized, most of the studies are based on models. Yet in realistic situations the models are often unknown and what…
We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of…