Here is the material you will learn:
A state of the Rule 90 pattern consists of an infinitely long sequence of digits which can each be either 0 or 1. Because an infinitely long sequence cannot be represented in a finite space, any digit not specified is assumed to be a zero. The sequence 11010001, for example, is actually surrounded by zeroes on both sides. For each step in the automaton, the next state is determined by applying a few rules to the current one. The basic idea is that you start with an initial position, compute the next step, compute the step after that, and continue as long as you want to see what the results are. What a digit will change to depends on the current state (y) of the digit, the digit to its left (x), and the digit to its right (z) based on these rules:
Commit these rules to memory using any technique you like, then take the test, which can be found here:
http://www.misterpoll.com/polls/555308 (For some reason, you can't view this page without disabling safe mode, but I promise there's no inappropriate content.)
You may use a pencil and paper to apply the rules, but please do not write down the rules or use anything you wouldn't be allowed to use in a real test. Your help is greatly appreciated.
- A cell consists of one number.
- A digit is a 1 or a 0.
- A string is a sequence of digits.
- General familiarity with cellular automata is fine, but specific knowledge about Rule 90 is not.
- You CAN use a pencil and paper while taking the test.