相关论文: Restricted Complexity, General Complexity
Contemporary relativity theory is restricted in two points: (1) a use of the Riemannian space-time geometry and (2) a use of inadequate (nonrelativistic) concepts. Reasons of these restrictions are analysed in [1]. Eliminating these…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
We introduce and study the random "locked" constraint satisfaction problems. When increasing the density of constraints, they display a broad "clustered" phase in which the space of solutions is divided into many isolated points. While the…
The 75th anniversary of Turing's seminal paper and his centennial year anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of new developments that his…
The paper "Is Complexity an Illusion?" (Bennett, 2024) provides a formalism for complexity, learning, inference, and generalization, and introduces a formal definition for a "policy". This reply shows that correct policies do not exist for…
We consider locally checkable labeling LCL problems in the LOCAL model of distributed computing. Since 2016, there has been a substantial body of work examining the possible complexities of LCL problems. For example, it has been established…
Complex systems are characterized by specific time-dependent interactions among their many constituents. As a consequence they often manifest rich, non-trivial and unexpected behavior. Examples arise both in the physical and non-physical…
Generalised Satisfiability Problems (or Boolean Constraint Satisfaction Problems), introduced by Schaefer in 1978, are a general class of problem which allow the systematic study of the complexity of satisfiability problems with different…
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case basis. We prove a very general classification for a wide…
The Jackiw-Teitelboim (JT) model arises from the dimensional reduction of charged black holes. Motivated by the holographic complexity conjecture, we calculate the late-time rate of change of action of a Wheeler-DeWitt patch in the JT…
A central theme in cosmology is the perplexing fact that the Universe is undergoing an accelerating expansion. The latter, one of the most important and challenging current problems in cosmology, represents a new imbalance in the governing…
The rising complexity of our terrestrial surrounding is an empirical fact. Details of this process evaded description in terms of physics for long time attracting attention and creating myriad of ideas including non-scientific ones. In this…
By Kolmogorov Complexity,two number-theoretic problems are solved in different way than before,one problem is Maxim Kontsevich and Don Bernard Zagier's Problem 3 \emph{Exhibit at least one number which does not belong to} $ \mathcal{P}$…
Quantum complexity is conjectured to probe inside of black hole horizons (or wormhole) via gauge gravity correspondence. In order to have a better understanding of this correspondence, we study time evolutions of complexities for generic…
In the first part of this paper, we present a unified framework for analyzing the algorithmic complexity of any optimization problem, whether it be continuous or discrete in nature. This helps to formalize notions like "input", "size" and…
The science of complexity is far from being fully understood and even its foundations are not well established. On the other hand, during the last decade, the random motion of particles or waves - the so-called diffusion - has been known…
Black-box complexity is a complexity theoretic measure for how difficult a problem is to be optimized by a general purpose optimization algorithm. It is thus one of the few means trying to understand which problems are tractable for genetic…
Formal explainability guarantees the rigor of computed explanations, and so it is paramount in domains where rigor is critical, including those deemed high-risk. Unfortunately, since its inception formal explainability has been hampered by…
In quantum chemistry, the price paid by all known efficient model chemistries is either the truncation of the Hilbert space or uncontrolled approximations. Theoretical computer science suggests that these restrictions are not mere…
While modern physics and biology satisfactorily explain the passage from the Big Bang to the formation of Earth and the first cells to present-day life, respectively, the origins of biochemical life still remain an open question. Since…