Explore >> Select a destination
|
You are here 
|
www.msoos.org | ||
| | | | |
www.dwheeler.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.cs.uic.edu
|
|
| | | | | ||
| | | | |
profmattstrassler.com
|
|
| | | Last year, in a series of posts, I gave you a tour of quantum field theory, telling you some of what weunderstand and some of what we don't. I still haven't told you the role that string theory plays inquantum field theory today, but I am going to give you a brief tour of string... | ||
