Explore >> Select a destination

You are here

 jeremykun.wordpress.com
Determinism and Finite Automata - A Primer - Math ? Programming
| | pressron.wordpress.com
What We Talk About When We Talk About Computation
14.1 parsecs away

Travel
| | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better...
| | accodeing.com
Duty calls - CSS3 is NOT proven to be turing complete!, Accodeing to you
11.8 parsecs away

Travel
| |
| | rjlipton.com
Proving Cook's Theorem | Gödel's Lost Letter and P=NP
12.1 parsecs away

Travel
| | 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.sebastiansylvan.com
Robin Hood Hashing should be your default Hash Table implementation // A Random Walk Through Geek-Space
78.7 parsecs away

Travel
|