Beenish Chaudry

Beenish Chaudry has a BA in computer science and mathematics from Smith College and a master's in mathematics from Indiana University, Bloomington. Currently, she is pursuing her PhD in computer science from Indiana University, Bloomington. There she is involved in the Women in Computing Club and Muslim Student Association, and likes to play squash and tennis. She loves the message of Quran.

An Empirical Investigation of the Complex Behavior of Reversible Turing Machines

Turing machines are well-known computational systems. Yet although they have been prominent in theoretical computer science for many decades, little empirical investigation of their reversible behavior has been done. The purpose of this study is to explore the range of behavior of different reversible Turing machines and figure out where the complex behavior first occurs in the space of possible reversible Turing machines.

Rule chosen: 16787316

To me, this rule says it's possible for different patterns to co-exist and be "co-calculated" in nature.