jlouis

43 ms·

421.
by jlouis 14y ago
It may have slowed down the occasional attacker who had no access to a HP-PA RISC cross compiler for his platform. But in todays world there is no reason.
422.
by jlouis 14y ago
Usually the in-memory representation is the same for objects and structs, given a garbage collected language.
423.
by jlouis 14y ago
Automated Therom Proving is ridiculously hard and a guess would be that it is almost impossible to train an ML algorithm to do this efficiently. However, verifying that a proof is correct is somewhat simple, if you give the machine enough
424.
by jlouis 14y ago
I don't doubt you, but my comment there was not directed at the CPE device. Rather for the code inside the program (on the PC endpoint) which has to deal with breaking through NAT.
425.
by jlouis 14y ago
You don't. There are something to be said about the Erlang semantics though: It is functional, which removes a lot of mistakes. Unlike other languages, there is fewer ways to "cheat" and use imperative features. It is a simple, yet powerful
426.
by jlouis 14y ago
NAT (Or more correctly PAT) was never a good idea and this is the main reason why the cheap network device suffer. It should not need any kind of intelligence. When some of us "Software" guys are up in arms over the slow IPv6 adoption it is
427.
by jlouis 14y ago
I would beware to just extrapolate numbers on a curve. There are some physical constraints which makes it impossible to improve certain numbers by much. And sometimes there are also logical constraints doing the same. We need somewhat accur
428.
by jlouis 14y ago
Battery? It just disables all the excess cores when it doesn't need them. Your bank account is a different matter though.
429.
by jlouis 14y ago
Let me tell you the reason: No laptop. Imagine that you just dock your phone into a screen when you want to work and that you don't have to haul a laptop around with you anymore. To get there, we need the machine-power-per-square-inch to sh
430.
by jlouis 14y ago
HTML .. when PostScript was way better. The many years spent with C and C++ when there are better alternatives around. Microsoft Windows, OSX, Linux when Plan9 exists. OOP. NoSQL and its total misunderstanding of the power of having a decla
431.
by jlouis 14y ago
Curiously, I wonder what they do then because they definitely have the vector data in the backend. Google Maps for Android has been vector based for 1.5 to 2 years now.
432.
by jlouis 14y ago
In my opinion, Bastion is one of the best games I have played in a long long time. I really enjoyed its writing, creativity and gameplay. The soundtrack is utterly amazing to boot.
433.
by jlouis 14y ago
Precisely. This is why I mentioned the 30-50 mems. A typical main memory fetch is somewhere in the 100-200ns range on modern hardware. I tend to measure the effectiveness of an algorithm based on, roughly, how it accesses memory. Caches pla
434.
by jlouis 14y ago
5 microsecs translates to 5000 nanos. Assuming an average CPI of 0.5 we have 10000 instructions to render the template. Or 30-50 main memory fetches. This isn't too shabby. But the numbers before the improvement. Ouch. Those were bad.
435.
by jlouis 14y ago
No. The hassle of getting that to work is probably way harder than just getting things to work on Linux in the first place. I think that Valve will eventually put out a libvalve which can be used to target a number of linux specific integ
436.
by jlouis 14y ago
Hah, all sane modern languages needs to patch LLVM for GC reasons :) The guys writing it did not really know a lot about that area and how to get those intrinsic features into the LLVM proper.
437.
by jlouis 14y ago
Slowly, go is getting into more and more places. This is yet another nice replacement. It is probably going to be way faster than the Ruby implementation in the long run.
438.
by jlouis 14y ago
What if they are wrong as in completely wrong? Then I dare say we are also in trouble. The only road not littered with trouble is if the current state and pace can be kept.
439.
by jlouis 14y ago
With due respect to the library, there are certain parts of it which is not supported out of the box in Erlang. On the other hand, building tools like what the library has is not going to take a long time.
440.
by jlouis 14y ago
Let me add to this. When you try to formalize a proof in a proof assistant, then almost all of the time, you will find numerous errors in the proof. But - and this is key - these errors are usually fixable or the area is not understood we
441.
by jlouis 14y ago
Job boards have one weakness: They reflect supply and demand. There is not much demand for Scala programmers. This may be because all positions are filled. Or, a more probable cause, that Scala programmers are not hired on Job boards. Note
442.
by jlouis 14y ago
This may be either disastrous or magnificent. I think it may end up being the latter.
443.
by jlouis 14y ago
I don't get this. What should be in focus is not your gender, nor your race. It is the talk you are going to give which should be the focus. I don't care if you are a man a woman, an indian, a japanese and so on. But I deeply care about the
444.
by jlouis 14y ago
The thing is that "slow" is naturally relative. I hate it when people claim that a tool is slow. By far the most important factor in getting programs that work isn't the technology but the mind behind the code. This is true for any programm
445.
by jlouis 14y ago
If your C code is doing linear scans over arrays where a dictionary style lookup is really needed, then there is no way in hell the C code is going to beat the Erlang code. I've seen this again and again in C programs. As for your Haskell p
446.
by jlouis 14y ago
It is not slow. This is a common misconception. Erlang is slow, if your problem has a certain structure. Your problem must be CPU bound. And constant factors must matter. In almost all other cases it is more capable than most other system
447.
by jlouis 14y ago
Let me add: The key point of the GC per process is that when heaps are small, pause times are also small. And since GC is counted against a process reductions frequently GCing processes get swapped out all the time and will not hurt the l
448.
by jlouis 14y ago
This isn't entirely true, see file:pread/2 for how to do it with a file. We lack a binary:pread/2 though :)
449.
by jlouis 14y ago
Many times :) writev() is hard to grasp.
450.
by jlouis 14y ago
You are correct, Sir.

More ›