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.).
[ Parent
| on HN ]
There are no comments on this comment yet.