Explore >> Select a destination
|
You are here 
|
www.greenteapress.com | ||
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
electronut.in
|
|
| | | | | I was recently reading about Conway's Game of Life - a cellular automaton discovered by British mathematician John Conway in 1970. Using 4...Read More | |
| | | | |
www.jeremykun.com
|
|
| | | | | Additional Patterns Last time we left the reader with the assertion that Conway's game of life does not always stabilize. Specifically, there exist patterns which result in unbounded cell population growth. Although John Conway's original conjecture was that all patterns eventually stabilize (and offered $50 to anyone who could provide a proof or counterexample), he was proven wrong. Here we have the appropriately named glider gun, whose main body oscillates, expelling a glider once per period. | |
| | | | |
craftofcoding.wordpress.com
|
|
| | | Visit the post for more. | ||
