Related papers: Spin Systems and Computational Complexity
We provide an overview of the different types of computational techniques developed over the years to study supercooled liquids, glassy materials and the physics of the glass transition. We organise these numerical strategies into four…
The problem of "what is 'system'?" is in the very foundations of modern quantum mechanics. Here, we point out the interest in this topic in the information-theoretic context. E.g., we point out the possibility to manipulate a pair of…
An outline of recent work on complex networks is given from the point of view of a physicist. Motivation, achievements and goals are discussed with some of the typical applications from a wide range of academic fields. An introduction to…
This paper is an attempt to incorporate the idea of spiking neural P systems as an early seed into the area of Operating System Design, regarding their capability to solve some classical computer science problems. It is reflecting the power…
The quantum statistics mechanism is very powerful for investigating the equilibrium states and the phase transitions in complex spin disorder systems. The spin disorder systems act as an interdisciplinary platform for solving the optimum…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
In certain mean field models for spin glasses there occurs a one step replica symmetry breaking pattern. As an example of general $1/N$-corrections in such systems, the fluctuations in the internal energy are calculated. For this specific…
We study the 3D Edwards-Anderson spin glasses, by analyzing spin-spin correlation functions in thermalized spin configurations at low T on large lattices. We consider individual disorder samples and analyze connected clusters of very…
This is a very basic introduction to some notions related to logic and complexity.
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…
Spin glasses are frustrated magnetic systems due to a random distribution of ferro- and antiferromagnetic interactions. An experimental three dimensional (3d) spin glass exhibits a second order phase transition to a low temperature spin…
Several approaches and corresponding definitions of complexity have been developed in different fields. Urban systems are the archetype of complex socio-technical systems concerned with these different viewpoints. We suggest in this chapter…
We briefly review some of the scientific challenges and epistemological issues related to climate science. We discuss the formulation and testing of theories and numerical models, which, given the presence of unavoidable uncertainties in…
This is a short review about recent methods and results, mostly for mean field spin glasses, based on interpolation and comparison schemes. In particular, the Parisi spontaneous replica symmetry breaking phenomenon is described in the frame…
Depth is a complexity measure for natural systems of the kind studied in statistical physics and is defined in terms of computational complexity. Depth quantifies the length of the shortest parallel computation required to construct a…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
This is a brief review of spin physics in semiconductors, as well as of the historic roots of the recent very active research of spin-related phenomena. The perspectives of "spintronics" are also discussed.
In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…
Brief review is given on recent numerical research of the ordering of two typical models of spin glasses (SGs), the three-dimensional (3D) Ising SG and the 3D Heisenberg SG models. Particular attention is paid to the questions of whether…
Models can be simple for different reasons: because they yield a simple and computationally efficient interpretation of a generic dataset (e.g. in terms of pairwise dependences) - as in statistical learning - or because they capture the…