Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
DSrcl
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
5 ms
·
1.
▲
by
DSrcl
9y ago
more sensical approach to analysing this program, e.g. as employed by a human, would be to see that NeverCalled() is the only function that can write Do It is not only non-trivial but also impossible (even) for a human to see if Nev
2.
▲
by
DSrcl
9y ago
The function pointer is static. But the function that mutates it, NeverCalled, is not. One can still indirectly change that function pointer.
3.
▲
by
DSrcl
9y ago
This is probably why there is not a proof yet, since the truth is undesirable. You are presenting an explanation to a false observation.
4.
▲
by
DSrcl
9y ago
Compile with -fno-frame-pointer and you won't see those code. It's for debugger.
5.
▲
by
DSrcl
9y ago
A lot of dota's mechanics is designed with the assumption that the player is human -- e.g. skills that can be programmed to be released perfectly but are hard for a human (even pro) to do so reliably (Shadow Fiend's raze is one of
6.
▲
by
DSrcl
9y ago
Except WebAsm is language independent and reuses DOM (indirectly through javascript).
7.
▲
by
DSrcl
9y ago
Labelling an operation -- number of steps of which upper-bounded by 6 -- "effectively constant" is different from considering any real world algorithm with bounded input size. Calling Scala's immutable vector ops "effect
8.
▲
by
DSrcl
9y ago
It blocks other interprocedural optimization such inlining and interprocedural const prop.
9.
▲
by
DSrcl
9y ago
It's unsafe for a compiler to do this in general (i.e. without annotations) because it can't determine dependencies that are external to the program -- e.g. `one=get(); two=get()`. The dependency between one and two is not obvious
10.
▲
by
DSrcl
9y ago
Register allocation in general is np-complete[1][2]. Having polynomial-time coloring algorithm for SSA doesn't make the allocation optimal -- you still need to "lower" the SSA to proper machine code. [1] http://w