/explore
|
You are here 
|
mnielsen.github.io | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
rjlipton.com
A new way to write mathematics Vladimir Voevodsky won the Fields Medal in 2002 for his work on homotopy theory of algebraic varieties. Using his pioneering methods he proved, among many other things, a deep conjecture of John Milnor, that had been open for decades. Today I want to talk about, no, rant about, a... |
|
| | | | | ||
| | | | |
pressron.wordpress.com
Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... |
|
| | | | | ||
| | | | |
www.yodaiken.com
|
|
| | | |||
