Get the latest tech news
Accidentally Turing-Complete
A list of things that were not supposed to be Turing-complete, but are.
Our result applies to how real Magic is played, can be achieved using standard-size tournament-legal decks, and does not rely on stochasticity or hidden information. To demonstrate its capabilities, we implemented a solution to the Merge Overlapping Intervals question and defined all the state transitions needed to solve this glorious problem. We present RedN, a principled, practical approach to implementing complex RDMA offloads, without requiring any hardware modifications.
Or read this on Hacker News