Outer Web | Explore

Explore >> Select a destination

You are here		math.andrej.com Mathematics and Computation \| Sometimes all functions are continuous
\|	\|	jdh.hamkins.org Alan Turing, On computable numbers \| Joel David Hamkins	11.9 parsecs away Travel
\|	\|	I have been reading Alan Turing's paper, On computable numbers, with an application to the entsheidungsproblem, an amazing classic, written by Turing while he was a student in Cambridge. This...	11.9 parsecs away Travel
\|	\|	rjlipton.com Proving Cook's Theorem \| Gödel's Lost Letter and P=NP	13.2 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...	13.2 parsecs away Travel
\|	\|	blog.sigfpe.com A Neighborhood of Infinity: What does topology have to do with computability?	9.4 parsecs away Travel
\|	\|		9.4 parsecs away Travel
\|	\|	www.yodaiken.com Three modest proposals for the C standard WG14 - keeping simple	101.2 parsecs away Travel
\|			101.2 parsecs away Travel