Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
tjgq
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
14 ms
·
91.
▲
by
tjgq
13y ago
> Yes, just like not all startups are successful for VCs. A dangerous analogy, because the sole criterion of success for a startup is to be financially successful, whereas there are lots of research ideas that cannot be translated into a
92.
▲
by
tjgq
13y ago
You are aware that not all research leads to concrete, patentable ideas, right?
93.
▲
by
tjgq
13y ago
> Saying that "APIs" are not copyrightable will render tons > of open source projects licenses invalid, since all open > source licenses "rest on top" eg append copyright laws. I don't think this is true. Open source licenses di
94.
▲
by
tjgq
13y ago
Only if your Book.Read method has the same signature as Reader.Read (i.e., not just the same name).
95.
▲
The true meaning of moral panics
(esr.ibiblio.org)
2 points
by
tjgq
13y ago
|
0 comments
96.
▲
by
tjgq
14y ago
Thanks. And wow, the CPython source code seems to be very much readable. I've been meaning to dive further into Python internals for a while, maybe this is the time to do so.
97.
▲
by
tjgq
14y ago
Okay, I think I get it now. The check you refer to is done inside the BINARY_ADD implementation. That's why the bytecode is the same for both cases. Am I right?
98.
▲
by
tjgq
14y ago
How can the interpreter know, at bytecode compilation time, that x is bound to an int? Surely it generates two code paths, one for the "common case" and another for when x is a general object with an __add__ method?
99.
▲
by
tjgq
14y ago
Technically, you could prove P=NP without actually discovering a polynomial-time algorithm for an NP-hard problem. Not all proofs are constructive.
100.
▲
by
tjgq
14y ago
This reminds me of this (slightly old) article, wherein the authors observe that about 1 in every 30,000 TCP packets fails the TCP checksum, even though the actual errors should have been caught by the link-level CRC. They go on to speculat
101.
▲
by
tjgq
14y ago
Note that no error detection code is able to detect all errors; it just lowers the probability of an error passing undetected even further. (CRCs are pretty robust in that they always detect sequences of errors with length <= N, with N
102.
▲
by
tjgq
14y ago
Interestingly, any physical, finite machine can be modelled as a finite state automaton (which is even more limited than a pushdown automaton) with a large enough state space. The distinction only comes up when you consider idealized infini
103.
▲
by
tjgq
14y ago
How is a "limit to how much memory [one] can address" not a physical, rather than logical, constraint? Really, the crux of the matter is that you can have a function call itself an unbounded number of times in C (i.e. unbounded recursion).
104.
▲
by
tjgq
14y ago
They hint that they use this huge regex instead of a parser for performance reasons. At any rate, the regex was not written by hand; it is a concatenation of simpler, easier to understand regexes.
105.
▲
by
tjgq
14y ago
> In the US, I think most places let you write in whoever you want. If they get enough votes, they win. Google "Lisa Murkowski". Yes, I would imagine write-ins could complicate the situation considerably (thanks for the link, btw!) - th
106.
▲
by
tjgq
14y ago
The key observation is that, since counting votes is an inherently distributed problem (with a comparatively simple centralized step at the end), you can always deal with it by adjusting the number of polling stations. I can speak for what
107.
▲
by
tjgq
14y ago
In general, function calls cannot be inlined by the Python compiler because (almost) any function name may be re-bound to a different object at run time. A very smart compiler could probably attempt to prove that no such modification can oc
108.
▲
by
tjgq
14y ago
At the very least, (s)he would have had to understand the main ideas to deem them interesting (though perhaps the details were difficult to follow). So yes, you're right that it isn't technically a contradiction. The way it was written did
109.
▲
by
tjgq
14y ago
On the topic of self-contradicting reviews, I once got one where the reviewer began by noting that "the paper is very difficult to read and almost impossible to understand" and proceeded to remark that "it contains very interesting ideas"..