/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
jeremykun.wordpress.com
We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
a3nm.net
List of open questions |
|
| | | | | ||
| | | | |
thevisualchronicle.com
1 post published by Joe on July 26, 2025 |
|
| | | |||
