News for hackers. Stuff that matters.
Re:Quasi-Polynomial Algorithm for Graph Isomorphism by bmh100 on Wednesday November 04, 2015 @04:42PM (#10509994)
Is this the sort of technology that could theoretically enable reasonably good, automated conversion between programming languages?
Re:Quasi-Polynomial Algorithm for Graph Isomorphism by obastani on Thursday November 05, 2015 @09:41AM (#10513527)
Not really, it's not hard to write a compiler to convert between different programming languages. The challenge is translating between the different semantics of different programming languages (e.g., object-oriented vs. functional, dynamically typed vs. statically typed, etc.).
Re:Quasi-Polynomial Algorithm for Graph Isomorphism by ThePhysicist on Thursday November 05, 2015 @05:04AM (#10512550)
I would say it's part of it but by far the only thing that you'd need to solve for this, in my opinion.