Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
ychen306
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
11 ms
·
61.
▲
by
ychen306
8y ago
Unfortunately it only works for toy examples. > cpmoptimize.recompiler.RecompilationError: Can't optimize loop: Unsupported instruction (LOAD_ATTR, 'b') at line 12 in fib, file "test.py"
62.
▲
by
ychen306
8y ago
The obvious usage of privacy is so you don't expose an API you don't want to maintain. It's also occasionally used to maintain some invariants; for instance, you can have a public method that wraps around some protected inter
63.
▲
by
ychen306
8y ago
I want to point out that because go has value type, it's possible to implement Arena Allocators using only safe Go, which is something one might need for these kind of games.
64.
▲
by
ychen306
8y ago
I think the standard term is Idiom Recognition.
65.
▲
by
ychen306
8y ago
Can you elaborate why being able to embed objects within another void this hypothesis?
66.
▲
by
ychen306
8y ago
I am not disagreeing with you but am confused on the issue. Java also has escape analysis, so I wonder what makes the difference here.
67.
▲
by
ychen306
8y ago
Did the research account for the leak resulted from fracking? This is good news regardless.
68.
▲
by
ychen306
8y ago
They way these annotations are used is really not part of the language. I prefer to view it machine-checkable documentations. It's more light-weight an higher level than your C/Java type systems.
69.
▲
Typed-Check Python in the Real World
(youtube.com)
1 points
by
ychen306
8y ago
|
0 comments
70.
▲
by
ychen306
8y ago
Beat me to it.
71.
▲
by
ychen306
8y ago
In your case, it only means you owe Google, but not the other user.
72.
▲
by
ychen306
8y ago
There's nothing "genetic" about how MCMC works. AFAIK, usually with GP, you keep multiple candidates that you evolve together, which is not the case here (it's much closer to metaheuristics such as Simulated Annealing),
73.
▲
by
ychen306
8y ago
Ah, I read the first link in the comments first, which really does imply they're using GP methods. No, it doesn't.
74.
▲
by
ychen306
8y ago
I am just providing a lower-bound to its performance.
75.
▲
by
ychen306
8y ago
Performance wise it's not slower than languages like Python. For some people (not me) macros simplify their development by a lot. The learning curve is honestly pretty shallow; in my experience Lisp is hard for people who haven't
76.
▲
by
ychen306
8y ago
It matters as a filter.
77.
▲
by
ychen306
8y ago
I took a cursory look at the output of C2rust, and it seems to only output unsafe code. What's the point of translating C to (unsafe) Rust code?
78.
▲
by
ychen306
8y ago
The difference between a supercomputer and a data center is how "connected" the computations are; supercomputer optimizes the communication between nodes. To put it another way, a data center does a lot of work but, most of the ti
79.
▲
by
ychen306
8y ago
I think he's referring to not having to explicitly declare if some type implements any interfaces.
80.
▲
John Hennessy and David Patterson Turing Award Lecture
(youtube.com)
6 points
by
ychen306
8y ago
|
0 comments
81.
▲
by
ychen306
8y ago
Overhead. It converts its IR to C; dumps that to disk; the C compiler loads the code back from the disk; the frontend parses the code (if not done carefully maybe CPP is also invoked); the compiler dumps the generated code to disk again; an
82.
▲
by
ychen306
8y ago
LLVM's JIT is in a sense different from that of, say, PyPy. It's more primitive. When people talk about JIT in the context of LLVM, they mean the set of APIs provided by LLVM's library. That is, give it a set of IR functions,
83.
▲
by
ychen306
8y ago
The article briefly explains. The reason is that there is no single metrics to measure the "goodness" of a school -- why would anyone want to swap schools otherwise? The example the article gives is some schools have better arts p
84.
▲
by
ychen306
8y ago
You can't scale linearly ad infinitum because eventually the communication (i.e. memory) cost gets too high. This reminds me of a thought experiment I heard from -- if memory serves -- Scott Aaronson. The gist is that the fastest super
85.
▲
by
ychen306
8y ago
Why is null in Go unsafe?
86.
▲
by
ychen306
8y ago
Hmm.. Looks like the author is reinventing fork-join style parallelism...
87.
▲
by
ychen306
8y ago
I agree with you. But this quote is badly written by the author -- they should have clarified further. In fact, compilers don't remove check of divisors that prevents div-by-0 precisely for this reason. What the authors mean is some
88.
▲
by
ychen306
9y ago
Hand-tuning code doesn't scale to the kind of networks people write.
89.
▲
by
ychen306
9y ago
Successful "reduction" from a NP-complete problem to an undecidable one :-)
90.
▲
by
ychen306
9y ago
I thought the issue is that the fallback doesn't clear the cache affected by the speculation but not speculation per se?
More ›