/explore
|
You are here 
|
gowers.wordpress.com | ||
| | | | |
windowsontheory.org
|
|
| | | | | (Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms... | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | [This post is dedicated to Luca Trevisan, who recently passed away due to cancer. Though far from his most significant contribution to the field, I would like to mention that, as with most of my ot... | |
| | | | |
scottaaronson.blog
|
|
| | | | | In Michael Sipser's Introduction to the Theory of Computation textbook, he has one Platonically perfect homework exercise, so perfect that I can reconstruct it from memory despite not having opened the book for over a decade. It goes like this: Let f:{0,1}*?{0,1} be the constant 1 function if God exists, or the constant 0 function... | |
| | | | |
limited.systems
|
|
| | | Although it might seem that a language like Haskell has a lot of different objects and constructs, they can all be reduced to functions. | ||
