We attempt to describe geometry in terms of informational quantities for the universe considered as a finite ensemble correlated quantum particles. As main dynamical principle, we use conservation sum all kinds entropies: thermodynamic, and informational. The fundamental constant speed is interpreted information velocity world also connected with gravitational potential on particle. two postula...

Informational entropy is quantitatively related to similarity and symmetry. Some tacit assumptions regarding their correlation have been shown to be wrong. The Gibbs paradox statement (indistinguishability corresponds to minimum entropy, which is zero) has been rejected. All their correlations are based on the relation that less information content corresponds to more entropy. Higher value of e...

The safety of quantum cryptography relies on the no-cloning theorem. In secret quantum communications, an eavesdropper cannot clone the sent qubits perfectly, however the best eavesdropping attacks for quantum cryptography are based on imperfect cloning machines. The eavesdropper’s physically allowed quantum evolutions on the sent qubit can be described in terms of the quantum state’s geometry....

Informational Entropies for Non-ergodic Brains Arturo Tozzi 1, James F. Peters 2,Marzieh Zare 3*, Mehmet Niyazi Çankaya 4 1 Center for Nonlinear Science, University of North Texas, Denton, Texas 76203, USA ; [email protected] 2 Department of Electrical and Computer Engineering, University of Manitoba 75A Chancellor’s Circle Winnipeg, MB R3T 5V6 Canada; [email protected] 3 Institute for ...

In this report the phenotypic effects of systematic site-directed mutations in the fission yeast RNA pol II carboxy terminal domain (CTD) are investigated. Remarkably, we find that alterations in CTD structure and/or phosphorylation result in distinct phenotypic changes related to morphogenetic control. A hypothesis based upon the concepts of "informational entropy" and "algorithmic transformat...

Together with stars and paths, b-ary trees are one of the most studied acyclic graph structures. As any other structure, a b-ary tree can be seen as containing information. The aim of the present research was to assess through informational entropy the structural information changes in b-ary trees after removal of an arbitrary vertex.

We propose variable rectilinear interpolation (VRI) as an alternative method for device characterization. Based on a rectilinear structure, this algorithm constructs a mapping with non-uniform nodes placed to maximize informational entropy while meeting the pre-defined error tolerance threshold. In this paper we describe the VRI algorithm and structure; followed by an example in which we charac...

In this work, we consider a recently proposed entropy I (called varentropy) defined by a variational relationship ) ( dx x d dI − = β as a measure of uncertainty of random variable x. By definition, varentropy underlies a generalized virtual work principle 0 = dx leading to maximum entropy 0 ) ( = − x I d β . This paper presents an analytical investigation of this maximizable entropy for severa...