Author details

cellular automata in random number generation are based on their apparent complex behavior. Although the direct process is very simple, it is not reversible—the complexity of the

Random number generation is one of the successful applications of cellular automata, particularly for cryptography and verification of circuits (BIST generators). This chapter presents a selection of the results presented in the scientific literature. Two main directions of research were identified, based on these examples: the mathematical approach to demonstrate the properties of particular rules and configurations, and the engineering and empiric approach to develop new architectures. Some examples are oriented toward "classic," close to ideal model of cellular automata, while others include consistent modifications at structural and functional levels. Both hardware and software cellular automata randomizers are reported in the scientific literature. The development of the FPGA technology offers efficient

I want to thank the editor for the suggestions that very much helped to improve this chapter.

This appendix presents the nomenclature conventions (A 1) for local rules, frequently used local rules (A 2) and some rules invoked in the discussion of Turing equivalence of cellular

The denomination of rules introduced by Wolfram [8] refers to 3-bit Boolean functions. Each function is designated by the configuration in the look-up table, read in reverse (hence, in this context, the look-up table is drawn starting with the last value). In A 1, the look-up table of the

Present state 111 110 101 100 011 010 001 000 Next state (of the central cell) 0 0 011110

Also, I would like to thank Eduard Franti for useful remarks and support.

inverse determination grows exponentially.

180 From Natural to Artificial Intelligence - Algorithms and Applications

solutions for hardware versions, when needed.

Acknowledgements

Conflict of interest

automata.

Here, rule 30.

The author declares no conflict of interest.

Appendix 1. Frequently used local rules

A 1. Each 3-bit rule is designated by the value in the look-up table.
