作者: Ferdinand Peper , Susumu Adachi , Jia Lee
DOI: 10.1007/978-1-84996-217-9_13
关键词: Cellular automaton 、 Cell state 、 Mobile automaton 、 Algorithm 、 Theoretical computer science 、 Asynchronous cellular automaton 、 Game of life 、 Robustness (economics) 、 Selection rule 、 Ideal (set theory) 、 Mathematics
摘要: The Game of Life is defined in the framework Cellular Automata with discrete states that are updated synchronously. Though this itself has proven to be fertile ground for research, it leaves open questions regarding robustness model respect variations updating methods, cell state representations, neighborhood definitions, etc. These may become important when ideal conditions under which supposed operate cannot satisfied, like physical realizations. This chapter describes three models Life-like behavior obtained, even though some basic tenets violated.