Abstract
In this paper we revisit the problem of using Genetic Algorithms to evolve 2-dimensional Cellular Automata (CA) as Pseudo-random Number Generators (PRNG). Our main contribution is two-fold. First, we review the problem of using CAs as PRNGs under the scope of the newer and more demanding batteries of pseudo-random generator tests that have been developed since the introduction of DIEHARD [1]. Second, we introduce a composite fitness metric, that incorporates elements from PRNG tests, to be used in the evolution of the CAs. © 2012 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Girau, B., & Vlassopoulos, N. (2012). Evolution of 2-dimensional cellular automata as pseudo-random number generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7495 LNCS, pp. 611–622). Springer Verlag. https://doi.org/10.1007/978-3-642-33350-7_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
