Searcharxiv⌕ Search

arXiv subjects

Gavriel Segre

Publications and source records attributed to Gavriel Segre.

36 records · Page 2Linked to original sources

A remark about the Mermin-Squires Music Hall's inteludium

The Mermin-Squires Music Hall inteludium on the Einstein-Podolsky-Rosen affair is analyzed by showing the fallacity of the One-Borel-Normality Criterion and the necessity of replacing it with the more restrictive Algorithmic-Randomness Criterion

quant-ph↗

The information-theoretical viewpoint on the physical complexity of classical and quantum objects and their dynamical evolution

Charles Bennett's measure of physical complexity for classical objects, namely logical-depth, is used in order to prove that a chaotic classical dynamical system is not physical complex. The natural measure of physical complexity for quantum objects, quantum logical-depth, is then introduced in order to prove that a chaotic quantum dynamical system is not physical complex too.

quant-ph↗

On the mathematical structure of Tonal Harmony

Some little step forward is made in the analysis of the mathematical structure of Tonal Harmony, a task begun by Galilei, Euler and the Lagrange of the first two volumes of Miscellania Taurinensia

math.HO↗

The No Cloning Theorem versus the Second Law of Thermodynamics

Asher Peres' proof that a violation of No Cloning Theorem would imply a violation of the Second Law of Thermodynamics is shown not to take into account the algorithmic-information's contribution to the Thermodynamical Entropy of the semi-permeable membranes of Peres' engine.

quant-ph↗

Law of Excluded Quantum Gambling Strategies

We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the definition of different kind of quantum casinos. The necessity of keeping into account entaglement (by the way we give a staightforward generalization of Schmidt's entanglement measure) forces us to adopt the general algebraic language of Quantum Probability Theory whose essential points are reviewed. The Mathematica code of two packages simulating, respectively, classical and quantum gambling is included. The deep link existing between the censorship of winning quantum gambling strategies and the central notion of Quantum Algorithmic Information Theory, namely quantum algorithmic randomness (by the way we introduce and discard the naive noncommutative generalization of the original Kolmogorov definition), is analyzed

quant-ph↗

Noncommutative Martin-Lof randomness : on the concept of a random sequence of qubits

Martin-Lof's definition of random sequences of cbits as those not belonging to any set of constructive zero Lebesgue measure is reformulated in the language of Algebraic Probability Theory. The adoption of the Pour-El Richards theory of computability structures on Banach spaces allows us to give a natural noncommutative extension of Martin-Lof's definition, characterizing the random elements of a chain Von Neumann algebra. In the particular case of the minimally informative noncommutative alphabet our definition reduces to the definition of a random sequence of qubits.

chao-dyn↗