Explore >> Select a destination
|
You are here 
|
accodeing.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... | |
| | | | |
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... | |
| | | | |
scottaaronson.blog
|
|
| | | So I've written an article about the above questionfor PBS's website---a sort of tl;dr version of my 2005 survey paperNP-Complete Problems and Physical Reality, butupdated with new material about the simulation of quantum field theories and about AdS/CFT. Go over there, read the article (it's free), then come back here to talk about it if... | ||
