Explore >> Select a destination
|
You are here 
|
mathwithbaddrawings.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... | |
| | | | |
jdh.hamkins.org
|
|
| | | | | 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... | |
| | | | |
jaydaigle.net
|
|
| | | | | This week we continue our exploration of what numbers are, and where mathematicians keep finding weird ones. Last time we defined the real numbers, but it took a lot of work. Now we'll see how truly strange they are. They're so strange that it's tempting to avoid them and stick with something simpler. But the real numbers do a much better job of describing modeling the parts of the world we care about. Their weirdness is exactly what we need to guarantee that a bunch of | |
| | | | |
mln84.wordpress.com
|
|
| | | The most common question students have about mathematics is "when will I ever use this?" Many math teachers would probably struggle to give a coherent answer, beyond being very good at following precise directions. They will say "critical thinking" but not much else concrete. Meanwhile, the same teachers must, with a straight face, tell their... | ||
