/explore
|
You are here 
|
emanueleviola.wordpress.com | ||
| | | | |
mycqstate.wordpress.com
A couple months from nowDorit Aharonov,David Gossetand myself will be giving a short 3.5-day "Spring School" that is meant to be an introduction to recent topics in quantum computing, directed at young researchers in theoretical computer science at large. Theschoolis organized by Shachar Lovett at the University of California in San Diego, from March 19th... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
micromath.wordpress.com
Continuing the theme of alternative approaches to teaching calculus, I take the liberty of posting a letter sent by Donald Knuth to to the Notices of the American Mathematical Society in March, 1998 (TeX file). Professor Anthony W. Knapp P O Box 333 East Setauket, NY 11733 Dear editor, I am pleased to see so... |
|
| | | |||
