executable or as a go library.
If you would like to contribute to gophersat, would like to use it but
don't know where to start, would like to understand how it works, or would
like a new feature to be added to it, please let me know.
Fabien
--
You received this message because you are
Short answer : according to the few tests I ran, they are pretty close. You
can use any of them, or, even better, both of them.
Long answer :
I have only compared them on about a dozen industrial problems, so take it
with a grain of salt, but it's hard to name a winner. Gini is usually a
littl
I'm working in an AI research lab and use golang a lot, so I would tend to
say yes. We're working in the symbolic AI field though (ontologies,
constraint solving and that stuff), not machine learning.
Le vendredi 22 décembre 2017 07:33:04 UTC+1, Lee Rick a écrit :
>
> hi,
>Artificial intelli
Hello gophers,
I'm currently trying to understand how versioning via dep currently works.
There are a few things I don't understand. I know this is work in progress,
and I don't know what's the current status about the famous diamond
dependency issue : what happens when two dependencies A & B r
Thanks for the link, I'll write a description of my problem.
Le samedi 23 décembre 2017 13:29:59 UTC+1, Mandolyte a écrit :
>
> Fabien, you mention below that generics would help... I encourage you to
> make a fuller description of why/how generics would help and update this
Thank you, that's a very interesting read.
TLDR: If I understood everything, NP-complete != DLL hell, but anyway, go
is vulnerable to DLL hell, so we're screwed.
I'm not sure I understand everything, though. Both your article and Russ
Cox' you mention seem to confuse NP-completeness and the con
y-bits (;-))
>
> On Tuesday, December 26, 2017 at 8:58:47 AM UTC-5, Fabien wrote:
>>
>> Thank you, that's a very interesting read.
>>
>> TLDR: If I understood everything, NP-complete != DLL hell, but anyway, go
>> is vulnerable to DLL hell, so we're screwed
Hello,
Detecting all unclosed Closers in any case sounds a bit undecidable to me
(sounds like the halting problem). But detecting some of them would be
feasible.
Le jeudi 28 décembre 2017 17:58:06 UTC+1, Brian Sorahan a écrit :
>
> That seems like a decent affirmation! Thanks.
>
> On Wednesday,