Explore >> Select a destination
|
You are here 
|
a3nm.net | ||
| | | | |
fredrikj.net
|
|
| | | | | ||
| | | | |
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... | |
| | | | |
gowers.wordpress.com
|
|
| | | | | It's been a while since I have written a post in the "somewhat philosophical" category, which is where I put questions like "How can one statement be stronger than an another, equivalent, statement?" This post is about a question that I've intended for a long time to sort out in my mind but have found... | |
| | | | |
cronokirby.com
|
|
| | | - Read more: https://cronokirby.com/posts/2021/01/making-an-io/ | ||
