03:41 <Guest65> =D

05:49 <clemens3> decompile? a decompiler takes machine code and tries to reproduce the source code

05:49 <clemens3> for assember, it is called a disassembler

05:50 <clemens3> by definition, it is the easiest

05:50 <clemens3> java has class/byte codes..

05:50 <clemens3> for interpreted languages, decompiler is by definition not the real think

05:51 <clemens3> thing

05:51 <clemens3> ah, the guy is not here anymore..

09:06 <nakilon> the 3rd time I successfully apply truffleruby -- previously it was shortest graph path search and esolang interpreter, now it's analyzing the chess opening moves

16:09 <havenwood> nakilon: nice

16:13 <havenwood> Intelo: Your assumptions don't hold up in this case. Decompiling machine code produced from assembly is about the easiest, not the hardest. The machine code maps to the assembly code almost 1:1, so it's the simplest of translation layers.

16:14 <havenwood> Interpreted languages like Ruby, Java, and JavaScript don't compile so they literally can't be decompiled. They're interpreted at runtime.

16:14 <havenwood> I think Elixir is lovely.

20:38 <nakilon> oh, my internet was down for a few hours so I didn't finish my message actually

20:38 <nakilon> was still connected by bnc

20:39 <nakilon> I made a thing that calculates the optimal minimal amount of moves to learn to mazimize your position advantage

20:40 <nakilon> I have to check again the algorithm but if I'm not wrong, it's enough to learn ~30 moves for each side to instantly have a +3.0 advantage

20:41 <nakilon> again statistically average >1500 ELO player

21:44 <havenwood> nakilon: I've been playing double fianchetto lately for fun

21:45 <havenwood> nakilon: nice, curious to see the code.

22:36 <joahim> hi