Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
enriquto
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
1698 ms
·
4501.
▲
by
enriquto
10y ago
Well, "common sense" is not the same for everybody then. For a mathematician, the rules 1/0 = INF, 1/(-0) = -INF are perfectly straightforward and common sense (if you think about the limits). Regarding sqrt(-0)=-0, I c
4502.
▲
by
enriquto
10y ago
Essentially everything you say here is false. Floating point numbers represent rational numbers, and their arithmetic is straightfoward and follows common sense: you compute the exact operation using rational numbers, and the result is the
4503.
▲
by
enriquto
10y ago
Why the line history limit, though? I do not want that my lines get deleted silently. ever. I would rather prefer that random files on my disk are deleted, before that. Is there any shell without line history limit?
4504.
▲
by
enriquto
10y ago
What do you mean? Variable-length arrays are OK in C.
4505.
▲
by
enriquto
10y ago
Doug McIlroy, the author of the message referred to in this thread.
4506.
▲
by
enriquto
10y ago
Legendary indeed ! I assume the author of this message is not using a pseudonym ?
4507.
▲
by
enriquto
10y ago
> For example, I predict stereo vision algorithms will die out soon, including deep-learning-assisted stereo vision Maybe for regular "cameras", but parallax still gives the most accurate results for 3D reconstruction from sate
4508.
▲
by
enriquto
10y ago
I use it daily for my work. It fits much better in the unix environment than other tools,
4509.
▲
by
enriquto
10y ago
you are missing the discrete time fourier transform, which is the dual of your point (2). Together, these eight domains can be arranged on a commutative cube, all of whose edges have beautiful meanings: sampling, interpolation, etc. The fa
4510.
▲
by
enriquto
10y ago
The discrete fourier transform is actually finite-dimensional linear algebra. No infinite series nor convergence problems here.
4511.
▲
by
enriquto
10y ago
The "namecount" example is rather silly though. It can be solved by a shell script much shorter than one line (sort|uniq -c).
4512.
▲
by
enriquto
10y ago
Of course, but not natively. Try doing that in plain python using a list of 8000 lists of 8000 lists of 3 numbers (e.g. a mid-resolution microscopy image).
4513.
▲
by
enriquto
10y ago
You want to process (typically, with simple arithmetical operations) huge arrays of numbers. Imagine that you want to sum two arrays of 800 MB of floating point numbers each. This is one step inside the loop of your algorithm. You can do
4514.
▲
by
enriquto
11y ago
Notice that this can be interpreted in two ways. The hacker's interpretation is that, if you want to improve your smarts then you have to code as cleverly as possible, otherwise you cannot learn anything when debugging! This is calle
4515.
▲
by
enriquto
11y ago
But be careful, his interpretation of P versus NP is rather light-hearted (but OK, given that it's not his speciality). He says: For example, breaking almost any cryptographic code can be phrased as an NP problem. So if P=NP—and if,
4516.
▲
by
enriquto
11y ago
And, by transposition, Stupid is Smart!
4517.
▲
by
enriquto
11y ago
From GCC documentation: "If you try to call the nested function through its address after the containing function exits, all hell breaks loose." I would definitely accept GCC lock-in, but so far GCC does not have this feature. Cl
4518.
▲
by
enriquto
11y ago
Closures. This is the only thing that I miss in C. I always want to declare local functions, and return pointers to them.
4519.
▲
by
enriquto
11y ago
Sorry, I didn't mean to say "bogus algorithm". What I wanted to say is that the results look equivalent as those that can be obtained by linear filtering and rescaling the input image (a standard retinex-like technique): Co
4520.
▲
by
enriquto
11y ago
Moreover, the algorithm is clearly bogus. The same results can be achieved by trivial contrast-enhancing filters.