Explore >> Select a destination
|
You are here 
|
a3nm.net | ||
| | | | |
rjlipton.com
|
|
| | | | | Or rather, what can the shapes of proofs tell us about them? April CACM source Juris Hartmanis did much to lay the landscape of computational complexity beginning in the 1960s. His seminal paper with Richard Stearns, "On the Computational Complexity of Algorithms," was published 50 years ago this month, as observed by Lance Fortnow in... | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | A key theme in real analysis is that of studying general functions $latex {f: X \rightarrow {\bf R}}&fg=000000$ or $latex {f: X \rightarrow {\bf C}}&fg=000000$ by first approximating them b | |
| | | | |
paperman.name
|
|
| | | | | ||
| | | | |
jeremykun.wordpress.com
|
|
| | | This half of the theory of computing primer will cover the various finite automata, including deterministic, nondeterministic, and pushdown automata. We devote the second half [upcoming] entirely to Turing machines and the halting problem, but to facilitate the discussion of Turing machines we rely on the intuition and notation developed here. Defining Computation The first... | ||
