相关论文: Entropy and perpetual computers

We present a statistical mechanical description of randomly packed spherical particles, where the average coordination number is treated as a macroscopic thermodynamic variable. The overall packing entropy is shown to have two…

This article serves as a summary outlining the mathematical entropy analysis of the ideal magnetohydrodynamic (MHD) equations. We select the ideal MHD equations as they are particularly useful for mathematically modeling a wide variety of…

We describe some basic results for Quantum Stochastic Processes and present some new results about a certain class of processes which are associated to Quantum Iterated Function Systems (QIFS). We discuss questions related to the Markov…

Problem of classification of all the set of entangled states is considered. Invariance of entangled states relative to transformations from a group of symmetry of qubit space leads to classification of all states of the system through…

Deformations of geometric characteristics of statistical hypersurfaces governed by the law of growth of entropy are studied. Both general and special cases of deformations are considered. The basic structure of the statistical hypersurface…

Current research in statistical mechanics mostly concerns the investigation of out-of-equilibrium, irreversible processes, which are ubiquitous in nature and still far from being theoretically understood. Even the precise characterization…

Making decisions freely presupposes that there is some indeterminacy in the environment and in the decision making engine. The former is reflected on the behavioral changes due to communicating: few changes indicate rigid environments;…

The Tsallis entropy is shown to be an additive entropy of degree-q that information scientists have been using for almost forty years. Neither is it a unique solution to the nonadditive functional equation from which random entropies are…

Information dynamics is an emerging description of information processing in complex systems which describes systems in terms of intrinsic computation, identifying computational primitives of information storage and transfer. In this paper…

We consider free fermion systems in arbitrary dimensions and represent the occupation pattern of each eigenstate as a classical binary string. We find that the Kolmogorov complexity of the string correctly captures the scaling behavior of…

We formulate, under general conditions, the problem of maximisation of the total entropy of the system, assumed to be in a composable form, for fixed total value of the constrained quantity. We derive the general form of the composability…

The definition of entropy obtained for stationary black holes is extended in this paper to the case of non-stationary black holes. Entropy is defined as a macroscopical thermodynamical quantity which satisfies the first principle of…

In contrast to entropy, which increases monotonically, the "complexity" or "interestingness" of closed systems seems intuitively to increase at first and then decrease as equilibrium is approached. For example, our universe lacked complex…

We approach the physical implications of the non-commutative nature of Complementary Observable Algebras (COA) from an information theoretic perspective. In particular, we derive a general \textit{entropic certainty principle} stating that…

In the previous papers (Kui\'{c} et al. in Found Phys 42:319-339, 2012; Kui\'{c} in arXiv:1506.02622, 2015), it was demonstrated that applying the principle of maximum information entropy by maximizing the conditional information entropy,…

We show that the concept of entropy and the dynamics of gravitation provide the linchpin in a unified scheme to understand the physics of black hole computers, space-time foam, dark energy, dark matter and the phenomenon of turbulence. We…

We discuss several algorithms for sampling from unnormalized probability distributions in statistical physics, but using the language of statistics and machine learning. We provide a self-contained introduction to some key ideas and…

Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting,ordered searching and max of N unordered numbers) into Maxwell demon thought…

We ask the question whether entropy accumulates, in the sense that the operationally relevant total uncertainty about an $n$-partite system $A = (A_1, \ldots A_n)$ corresponds to the sum of the entropies of its parts $A_i$. The Asymptotic…

We consider entanglement through permeable interfaces in the c=1 (1+1)-dimensional conformal field theory. We compute the partition functions with the interfaces inserted. By the replica trick, the entanglement entropy is obtained…