Abstract
Sequences of numbers that can be used as-is or transformed into random numbers are the topic of this chapter. We are not concerned here with the practicality of such sequences for use where pseudorandom generators are typically used, but instead present them for fun as they are interesting in their own right. We will look at the randomness of the digits in base 10 and base 16 expansions of numbers that are known to be normal or believed to be normal. We will consider the sequence of digits in factorials of different sizes. We will look at the sequence of bits generated by 1-D cellular automata, in particular Wolfram’s “Rule 30”. Lastly, we will consider how to use 1-D chaotic maps to generate a sequence of random numbers. In all cases we will test the sequences using either dieharder, TestU01, or ent. We conclude the chapter with a section on using genetic programming to evolve a simple pseudorandom number generator.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Borel, M. Émile. “Les probabilités dénombrables et leurs applications arithmétiques.” Rendiconti del Circolo Matematico di Palermo (1884–1940) 27, no. 1 (1909): 247–271.
Kneusel, Ronald T. Numbers and Computers. Springer International Publishing, 2017.
Kennedy, R. J. and Eberhart,“ Particle swarm optimization.” In Proceedings of IEEE International Conference on Neural Networks IV, pages, vol. 1000. 1995.
Conway, John. “The game of life.” Scientific American 223, no. 4 (1970): 4.
Wolfram, Stephen. A new kind of science. Vol. 5. Champaign: Wolfram media, 2002.
Pareek, Narendra K., Vinod Patidar, and Krishan K. Sud. “A Random Bit Generator Using Chaotic Maps.” IJ Network Security 10, no. 1 (2010): 32–38.
Koza, John R. Genetic programming: on the programming of computers by means of natural selection. Vol. 1. MIT press, 1992.
Koza, John R. “Evolving a Computer Program to Generate Random Numbers Using the Genetic Programming Paradigm.” In ICGA, pp. 37–44. 1991.
Lamenca-Martinez, Carlos, Julio Cesar Hernandez-Castro, Juan M. Estevez-Tapiador, and Arturo Ribagorda. “Lamar: A new pseudorandom number generator evolved by means of genetic programming.” In PPSN, pp. 850–859. 2006.
Picek, Stjepan, Dominik Sisejkovic, Vladimir Rozic, Bohan Yang, Domagoj Jakobovic, and Nele Mentens. “Evolving cryptographic pseudorandom number generators.” In International Conference on Parallel Problem Solving from Nature, pp. 613–622. Springer International Publishing, 2016.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this chapter
Cite this chapter
Kneusel, R.T. (2018). Other Random Sequences. In: Random Numbers and Computers. Springer, Cham. https://doi.org/10.1007/978-3-319-77697-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-77697-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77696-5
Online ISBN: 978-3-319-77697-2
eBook Packages: Computer ScienceComputer Science (R0)