English
Related papers

Related papers: Noise vs computational intractability in dynamics

200 papers

We study the computational complexity theory of smooth, finite-dimensional dynamical systems. Building off of previous work, we give definitions for what it means for a smooth dynamical system to simulate a Turing machine. We then show that…

Computational Complexity · Computer Science 2024-09-19 Jordan Cotler , Semon Rezchikov

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…

Computational Complexity · Computer Science 2011-06-24 Hector Zenil , Fernando Soler-Toscano , Joost J. Joosten

Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…

Other Computer Science · Computer Science 2014-10-31 Nabarun Mondal , Partha P. Ghosh

It is well known that chaotic dynamic systems (such as three-body system, turbulent flow and so on) have the sensitive dependance on initial conditions (SDIC). Unfortunately, numerical noises (such as truncation error and round-off error)…

Chaotic Dynamics · Physics 2016-09-30 Xiaoming Li , Shijun Liao

Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard…

Computational Complexity · Computer Science 2015-07-06 Nabarun Mondal , Partha P. Ghosh

Metastability is a spurious mode of operation in digital signals, where an electrical signal fails to settle into a stable state within a specified time, leading to uncertainty and potentially failing downstream hardware. A system that…

Computational Complexity · Computer Science 2026-04-21 Johannes Bund , Amir Leshem , Moti Medina

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…

Computational Complexity · Computer Science 2012-03-16 Yaroslav D. Sergeyev , Alfredo Garro

Computers are deterministic dynamical systems (CHAOS 19:033124, 2009). Among other things, that implies that one should be able to use deterministic forecast rules to predict their behavior. That statement is sometimes-but not always-true.…

Chaotic Dynamics · Physics 2013-05-24 Joshua Garland , Ryan James , Elizabeth Bradley

As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…

Logic · Mathematics 2019-11-19 Nathanael L. Ackerman , Cameron E. Freer , Daniel M. Roy

The unpredictability in chaotic scattering problems is a fundamental topic in physics that has been studied either in purely conservative systems or in the presence of weak perturbations. In many systems noise plays an important role in the…

Chaotic Dynamics · Physics 2021-07-14 Alexandre R. Nieto , Jesús M. Seoane , Miguel A. F. Sanjuán

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…

Optimization and Control · Mathematics 2026-01-21 Pavel Osinenko

Small random perturbations may have a dramatic impact on the long time evolution of dynamical systems, and large deviation theory is often the right theoretical framework to understand these effects. At the core of the theory lies the…

Numerical Analysis · Mathematics 2017-10-11 Tobias Grafke , Tobias Schaefer , Eric Vanden-Eijnden

Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the…

Chaotic Dynamics · Physics 2010-09-30 Cristian S. Calude , Elena Calude , Karl Svozil

Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…

Information Theory · Computer Science 2007-07-13 Cristian S. Calude , Michael A. Stay

We address the problem of the relative importance of the intrinsic chaos and the external noise in determining the complexity of population dynamics. We use a recently proposed method for studying the complexity of nonlinear random…

Chaotic Dynamics · Physics 2009-11-07 J. A. Gonzalez , L. Trujillo , A. Escalante

Many real-world dynamic systems, both natural and artificial, are understood to be performing computations. For artificial dynamic systems, explicitly designed to perform computation - such as digital computers - by construction, we can…

Computational Physics · Physics 2026-02-24 David H. Wolpert , Jan Korbel

The effect of multiplicative noise to the Turing instability of the Brusselator system is investigated. We show that when the noise acts on both of the concentrations with the same intensities, then the Turing instability is suppressed…

Analysis of PDEs · Mathematics 2025-03-24 Qasim Khan , Anthony Suen , Bao Quoc Tang

Nonlinear dynamical systems subjected to a combination of noise and time-varying forcing can exhibit sudden changes, critical transitions or tipping points where large or rapid dynamic effects arise from changes in a parameter that are…

Chaotic Dynamics · Physics 2024-05-21 Peter Ashwin , Julian Newman , Raphael Römer

Stochastic inverse problems considered in this article consist of estimating the probability distributions of intrinsically random inputs of computer models. These estimations are based on observable outputs affected by model noise, and…

Statistics Theory · Mathematics 2025-03-17 Nicolas Bousquet , Mélanie Blazère , Thomas Cerbelaud

Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…

Chaotic Dynamics · Physics 2009-11-07 G. Boffetta , M. Cencini , M. Falcioni , A. Vulpiani
‹ Prev 1 2 3 10 Next ›