Related. Others?
For algorithms, a little memory outweighs a lot of time - https://news.ycombinator.com/item?id=44055347 - May 2025 (139 comments)
What are the practical implications and use cases of this?
Is it something like some sort of reverse compiler which creates super efficient code by analyzing the inverse flow of code or something?
From Februray 2025 fwiw. Same result there have been multiple articles here about. I wonder how it would work for Haskell programs (no mutable memory).
[dupe]
It’s nice to see what a little bitwise manipulation can do(XOR)! Low level programming is always fun!
See Kelsey Houston-Edwards's exceptional breakdown of Williams' paper, & Scott Aranson's thoughts on the topic.
[1] https://www.youtube.com/watch?v=8JuWdXrCmWg
[2] https://scottaaronson.blog/?p=8680