How much initial-state precision is required to predict a nonlinear system to a prescribed accuracy over a finite horizon? We formulate this inverse prediction problem through a one-shot resource $B_N$, defined as the number of binary refinement bits required in the initial state by a specified local sensing architecture. Within a common scale-separable error-growth regime, changing a fixed tolerance changes $B_N$ only by an $N$-independent offset. An exactly solvable circle/Chebyshev map provides the chaotic calibration $B_N=N\log_2 m+O(1)$. We then apply the framework to the quasiperiodically forced logistic map under phase-only initial uncertainty. Over the resolved horizons, representative smooth-torus, strange-nonchaotic-attractor (SNA), and chaotic regimes exhibit a three-level precision-resource hierarchy: bounded, logarithmic-like, and linear-like growth, respectively. For the SNA, algebraic phase sensitivity $G_N^{\mathrm{op}}\sim N^\mu$ implies an admissible initial uncertainty of order $N^{-\mu}$, and therefore a precision cost proportional to $\log N$. Phase-grid refinement shows that the sampled worst-case maxima are numerically stable with increasing phase resolution. Near the torus--SNA fractalization point, derivative-based phase sensitivity can already grow while finite perturbations remain below a fixed operational tolerance for more than $10^6$ iterations, revealing exceptionally long activation horizons. Thus an SNA can occupy an intermediate finite-precision resource class between a smooth torus and ordinary chaos, while its operational manifestation can occur on a much longer timescale than its derivative-based sensitivity.
The edge-of-chaos hypothesis holds that recurrent systems near criticality maximize memory capacity and expressivity, motivating a natural proposal: replace the non-chaotic linear recurrence of state-space models with a learnable chaotic one. We test this with a gain-tunable chaotic cell whose expansion is set by one c...
Mohammad O. Alhawarat, Hamed Elsimary, Ahmad Shalaldeh et al.· Entropy· 0 citations
How much precision must be allocated, and to which uncertainty channels, to meet a prediction requirement? We formulate a minimum one-shot specification cost over initial state variables and persistent forcing parameters. The central result is that prediction accuracy can select the horizon-scaling law of this resource...
Autoregressive models are trained to predict a system's behavior one step at a time, and recursive generation allows the learned dynamics to unfold over long horizons. To what extent can such dynamics learned from local observations recover broader organization of an underlying system that was only partially observed d...
Yi-Lun Liu, Yi Zhang, Gan-Yu Wu et al.· arXiv.org· 0 citations
The one-dimensional swarmalator model is usually understood through three macroscopic states: synchrony, the phase wave, and asynchrony. We show that the identical model also contains a much larger set of hidden stable equilibria - families of q-twisted and m-clustered states - which random initial conditions almost ne...
Rommel Tchinda Djeudjo, K. O'Keeffe, Timoteo Carletti· 0 citations
Accurately simulating chaotic quantum many-body dynamics remains a major computational challenge for classical methods, due to the rapid buildup and spatial spreading of entanglement during the evolution. This raises the question of whether machine learning can provide an effective alternative for predicting quantum dy...
Francesco Perciavalle, Agostino Gallo, F. Plastina et al.· 0 citations
Feeding a pretrained language model the expected embedding of its own next-token distribution turns it into a discrete-time dynamical system with continuous states. Across Qwen2.5, OLMo-2 and Llama-3 models from 0.5B to 72B parameters, temperature and activation steering move this loop between repeating text and chaos,...
Timothy D. Jones· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.