Ryan Williams
rrwilliams.bsky.social
professor of EECS at MIT. working in theoretical computer science namely algorithm design, complexity theory, circuit complexity, etc. i'll let you know when P != NP is proved (and when it's not)
👤 Joined on 04 March 2024
1555
Followers
184
Following
54
Total Posts
📜 Kullanıcı Geçmişi
- 04 Mar 2024, 03:44
🎉 Bluesky'e katıldı - İlk kullanıcı adı:
@rrwilliams.bsky.social
🚫 Blokladığı Kullanıcılar
❤️ Beğendiği Gönderiler
The submission server for #STOC2027 is open! stoc27.hotcrp.com Submission instructions and Call for Paper: acm-stoc.org/stoc2027/sto...
Show Post
OpenAI’s Tuesday dump of 372 AI-generated results, if they’re right (big if), is big. Like, fields-medal big. Controversy abound, but my colleague Joseph Howlett and I dug through some of the claimed results that stand out. Article here: www.scientificamerican.com/article/the-..., thread below
Show Post"When you prove a theorem, you are imparted a responsibility to the field. At minimum you need to explain what you did, including which steps required new ideas and which steps are already well-known."
Show Post
I Wrote about the responsibility we carry to each other.
Show Post