Explore >> Select a destination
|
You are here 
|
www.yodaiken.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... | |
| | | | |
www.pl-enthusiast.net
|
|
| | | | | This blog post is the first in my series on secure computationand will be presented in two parts. It briefly introduces some work my collaborators and I published this year, which illustrates a pleasant application of programming languages ideas to ... Continue reading ? | |
| | | | |
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. | |
| | | | |
jack-clark.net
|
|
| | | Google DeepMind and 33 labs make the world's largest AI robot training set - and uses it to create capability emergence:...Open X-Embodiment dataset is a giant, diverse dataset, that may make robots much, much better...Google DeepMind and 33 academic labs to combine data recorded from 22 different robots around the world to create a really... | ||
