Landmark Algorithm Breaks 30-Year Impasse John Hardy Lambda December 20, 2015 1 Minute Originally shared by Richard Walker http://www.wired.com/2015/12/landmark-algorithm-breaks-30-year-impasse/ Share this: Share on X (Opens in new window) X Share on Facebook (Opens in new window) Facebook Like Loading... Related Published by John Hardy Closures are a poor man's object. Objects are a poor man's closure. View all posts by John Hardy Published December 20, 2015
I wouldn’t even know how to represent a graph computationally let alone compare two to see if they’re the same. LikeLike Reply
Well, doubly-linked lists is a simple form, right? They’re not talking actual pictures, just nodes with (edge-)connections. The Pepsi-test discussion is a little odd… LikeLike Reply
John Hardy Developer 
I wouldn’t even know how to represent a graph computationally let alone compare two to see if they’re the same.
LikeLike
Well, doubly-linked lists is a simple form, right? They’re not talking actual pictures, just nodes with (edge-)connections.
The Pepsi-test discussion is a little odd…
LikeLike