A Statistical Complexity measure has been recently proposed to quantify the performance of chaotic Pseudorandom number generators (PRNG) (Physica A 354 (2005) 281). Here we revisit this quantifier and introduce two important improvements: (i) consideration of an intensive statistical complexity...

We investigate the classical limit of the dynamics of a semiclassical system that represents the interaction between matter and a given field. The concept of Fisher Information measure (F) on using as a quantifier of the process, we find that it adequately describes the transition, detecting the...

Pseudorandom number generators (PRNG) are extensively used in Monte Carlo simulations, gambling machines and cryptography as substitutes of ideal random number generators (RNG). Each application imposes different statistical requirements to PRNGs. As L’Ecuyer clearly states “the main goal...

Pseudo Random Number Generators (PRNG) have attracted intense attention due to their obvious importance for many branches of science and technology. A randomizing technique is a procedure designed to improve the PRNG randomness degree according the specific requirements. It is obviously...

We discuss bounds on the values adopted by the generalized statistical complexity measures [M.T. Martin et al., Phys. Lett. A 311 (2003) 126; P.W. Lamberti et al., Physica A 334 (2004) 119] introduced by López Ruiz et al. [Phys. Lett. A 209 (1995) 321] and Shiner et al. [Phys. Rev. E 59 (1999)...