Explore >> Select a destination
|
You are here 
|
rjlipton.com | ||
| | | | |
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... | |
| | | | |
francisbach.com
|
|
| | | | | ||
| | | | |
windowsontheory.org
|
|
| | | | | Previous post: ML theory with bad drawings Next post: What do neural networks learn and when do they learn it, see also all seminar posts and course webpage. Lecture video (starts in slide 2 since I hit record button 30 seconds too late - sorry!) - slides (pdf) - slides (Powerpoint with ink and animation)... | |
| | | | |
www.ethanepperly.com
|
|
| | | |||
