Related papers: Complexity in some Physical Systems
We comment on some conceptual and and technical problems related to computational mechanics, point out some errors in several papers, and straighten out some wrong priority claims. We present explicitly the correct algorithm for…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
Several well-known statistical measures similar to \emph{LMC} and \emph{Fisher-Shannon} complexity have been computed for confined hydrogen atom in both position ($r$) and momentum ($p$) spaces. Further, a more generalized form of these…
A survey of physical parameters and of a ladder of various regimes of laser-matter interactions at extreme intensities is given. Special emphases is made on three selected topics: (i) qualitative derivation of the scalings for probability…
A recently introduced concept of complexity for relativistic fluids is extended to the vacuum solutions represented by the Bondi metric. A complexity hierarchy is established, ranging from the Minkowski spacetime (the simplest one) to…
We study the build up of complexity on the example of 1 kg matter in different forms. We start on the simplest example of ideal gases, and then continue with more complex chemical, biological, life and social and technical structures. We…
Nearly 30 years ago, J.P. Crutchfield and K. Young proposed in Phys. Rev. Lett. {\bf 63}, 105 (1989) some supposedly novel measures of time series complexity, and their relations to existing concepts in nonlinear dynamical systems. At that…
The paper offers a discrete thermodynamic model of lasers. Laser is an open system; its equilibrium is based on a balance of two thermodynamic forces, one related to the incoming pumping power and another to the emitted light. The basic…
Mathematical ideas and approaches common in complexity-related fields have been fruitfully applied in experimental high energy physics also. We briefly review some of the cross-pollination that is occurring.
While "complexity science" has achieved significant successes in several interdisciplinary fields such as economics and biology, it is only a very recent observation that legal systems -- from the way legal texts are drafted and connected…
We investigate circuit complexity to characterize chaos in multiparticle quantum systems. In the process, we take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity…
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic…
We study the complexity (that is, the weight of the multiplication table) of the elliptic normal bases introduced by Couveignes and Lercier. We give an upper bound on the complexity of these elliptic normal bases, and we analyze the weight…
We consider representing of natural numbers by expressions using 1's, addition, multiplication and parentheses. $\left\| n \right\|$ denotes the minimum number of 1's in the expressions representing $n$. The logarithmic complexity $\left\|…
The linear ordering problem (LOP), which consists in ordering M objects from their pairwise comparisons, is commonly applied in many areas of research. While efforts have been made to devise efficient LOP algorithms, verification of whether…
These are intended to be review notes on emergent symmetries, i.e., symmetries which manifest themselves in specific sectors of energy in many systems. The emphasis is on the physical aspects rather than computation methods. We include some…
We consider the problem of computing the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints that admit quadratic relaxations. These non-convex constraints include semialgebraic sets and other…
Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…
The statistical measures of complexity defined by Lopez-Ruiz, Mancini, and Calbet (LMC) and Shiner, Davison and Landsberg (SDL) are calculated as functions of the number of particles for four quantum many-body systems, i.e. atoms, nuclei,…
Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…