tbingmann

10 ms·

1.
by tbingmann 9y ago
KPI #1: actually know something about your technology
2.
by tbingmann 10y ago
Interesting. I have a theory that most historic shifts are mainly due to some technological advancement or invention, and not mainly due to politics. For example, Nazi Germany may have been the result of the invention or mass distribution o
3.
by tbingmann 10y ago
There is (at least) one important missing: the Simplex Algorithm, or more generally algorithms for solving linear programs (LPs). These are used every day to optimize highly complex problems in real world economics.
4.
by tbingmann 11y ago
Sorry, but this is another really bad comparison to Venice. These cities have nowhere near the history of Venice as a medieval trade metropolis, nor are they actually built on islands in a lagoon. If you must compare a city with lots of can
5.
by tbingmann 11y ago
Whenever I read something like this I have a bad feeling about it. They are trying to get "C/C++" performance in Java by bypassing all the JVM's management and garbage collection. They even basically reimplemented malloc
6.
by tbingmann 11y ago
Best ask them first via email.
7.
by tbingmann 11y ago
Slack, Zulip, this feels like we are back in 1999, when the internet was divided by ICQ, AOL Instant Messanger, Windows Live Messanger, and Yahoo Messanger. (Instant/Live was a plus back then). And the only innovation over IRC was a ba
8.
by tbingmann 12y ago
Looks like a list of familiar titles. I already read 19 of the 32, do I have to worry? They were very good books, though.
9.
by tbingmann 12y ago
It has electrolytes!
10.
by tbingmann 12y ago
The article is completely by side the point. He's basically ranting about how they can't test systemd on all distros, because every distro does things differently. How to fix it? Virtualize distros, yay. That may fix your problem,
11.
by tbingmann 13y ago
I made a video of how the algorithm works: http://youtu.be/NjcSyD7p660 To make it I needed a C++ version with iterators, which I though would be faster. But it is still about 20% slower than stable_sort for the default rand
12.
by tbingmann 13y ago
In a nutshell: to keep an index into an array of size n requires log_2(n) bits. Thus any algorithm, which keeps even just one index into the input takes Omega(log n) space. Yay for pedantic asymptotics.