Re:What's missing from Erlang...
on
Programming Erlang
·
· Score: 2, Informative
The implementation issue was that you had to choose between performance and being able to reload functions later. I would very much like it to be able to JIT or even compile down to binary (x86_64 too, pretty please?), then be able to just leave it running, and have it reload functions as needed.
There is HiPE, which compiles Erlang to native code. And you can HiPE compile modules together with normal BEAM (interpreted code), with function granularity. And then reload the modules using BEAM and/or HiPE, again and again.
But the reason for commenting your comment was the x86_64 part. HiPE has had x86_64 support for three years now. And its creation made me learn to write the x86_64 machine language in hex...
We already have something like Open Source politics here in Sweden. By default, any record that is part of the public system is accessible to the public. Only some kinds of data is stamped secret.
That means that I can enter any government building (or call them) and get access to almost anything. What politicians do and the material they use for their decisions is always available.
On the other hand medical data (for instance) is not accessible, and is secret by default.
All of this will probably disappear in EU though, since there things are secret unless stamped public.
The thing is, in real life applications, playing with a Targa file is not the same as service critical, 300 users, number crunching, data handling systems, where a small performance improvement must be multiplied by the number of users/uses, by many many hours of operation and by years in service to understand its true impact.
Erlang is a functional programming language which supports concurrency, communication, distribution, fault-tolerance, automatic memory management, and on-line code updates. It was designed for soft real-time control systems which are commonly developed by the telecommunications industry. It runs in system where there are demands on 99.999% uptime. Ever tried to use a phone? Most likely the software for connecting you was written (at least partly) in Erlang.
I think that Erlang handles "service critical, 300 users" systems with no problems at all. Watch that C/C++ server go down when those numbers rise to 3,000, or 30,000.
You can find a Swedish robot project at http://humanoid.fy.chalmers.se/. Featuring Elvis (named so because he moved his hips when he learned to walk), who is a tad bit smaller but has learned to walk all by himself (genetic programming).
The problem with that is that you will not have any rights either. Anyone that passes can take control of your raft and if you choose to attack the other boat you have declared war on that nation. Hmm, on the other hand; try to get stuff out to the ocean without using a boat from a nation...
Yes, I remember when google was just a child. I started using google when it was still a science project then stopped using it for a while. How happy I got when I heard that they had gotten a real web site; and now they have gone so fast as to go past many of the other sites. I hope that google can put an end to those portals and allow us to go back to the old plain search engines. (I heard that altavista has a plain version; is that beacause of google?)
Anyone remember what issue of new scientist that had a story about search engines in summer-autumn of 1998? I remember that they mentioned how google works, and I'd really like to read it again. (at least I think it was new scientist)
I'll just answer them in turn: 1) No, there is no percentage of fair use. 2) Nope, not that either. It's still the same source. 3) Not if you copy it keystroke by keystroke (except the names). 4) Yes, you need a patent to protect the algorithm (and even then certain algorithms will be hard to protect).
You could of course write exactly the same code by mistake. That is not a violation. But unless you can prove that you have written exactly the same code without ever looking at the source you are copying you will go down in court...
Your friends program wouldn't help prove anything. The problem with proving is that you have to show that for every natural number n that some predicate holds. That will mean in this case that your friends program will have to run an infinitely long time to prove anything. So I don't think you friend would like to eat CPU for that.
I have heard somewhere that the predicate has been tested for all numbers up to some big number (in the range of 10^12 i think).
Slashdot Mirror
There is HiPE, which compiles Erlang to native code. And you can HiPE compile modules together with normal BEAM (interpreted code), with function granularity. And then reload the modules using BEAM and/or HiPE, again and again.
But the reason for commenting your comment was the x86_64 part. HiPE has had x86_64 support for three years now. And its creation made me learn to write the x86_64 machine language in hex...
Note: I did the x86_64 backend as part of my Master's thesis.
One relevant paper: http://www.update.uu.se/~luna/papers/ppdp05.pdf
We already have something like Open Source politics here in Sweden. By default, any record that is part of the public system is accessible to the public. Only some kinds of data is stamped secret.
That means that I can enter any government building (or call them) and get access to almost anything. What politicians do and the material they use for their decisions is always available.
On the other hand medical data (for instance) is not accessible, and is secret by default.
All of this will probably disappear in EU though, since there things are secret unless stamped public.
Erlang is a functional programming language which supports concurrency, communication, distribution, fault-tolerance, automatic memory management, and on-line code updates. It was designed for soft real-time control systems which are commonly developed by the telecommunications industry. It runs in system where there are demands on 99.999% uptime. Ever tried to use a phone? Most likely the software for connecting you was written (at least partly) in Erlang.
I think that Erlang handles "service critical, 300 users" systems with no problems at all. Watch that C/C++ server go down when those numbers rise to 3,000, or 30,000.
Just my two cents...
MP3 support for linux has been around for ages. Take a look at mpg123 for instance.
You can find a Swedish robot project at http://humanoid.fy.chalmers.se/.
Featuring Elvis (named so because he moved his hips when he learned to walk), who is a tad bit smaller but has learned to walk all by himself (genetic programming).
The problem with that is that you will not have any rights either. Anyone that passes can take control of your raft and if you choose to attack the other boat you have declared war on that nation. Hmm, on the other hand; try to get stuff out to the ocean without using a boat from a nation...
Yes, I remember when google was just a child. I started using google when it was still a science project then stopped using it for a while. How happy I got when I heard that they had gotten a real web site; and now they have gone so fast as to go past many of the other sites. I hope that google can put an end to those portals and allow us to go back to the old plain search engines. (I heard that altavista has a plain version; is that beacause of google?)
Anyone remember what issue of new scientist that had a story about search engines in summer-autumn of 1998? I remember that they mentioned how google works, and I'd really like to read it again. (at least I think it was new scientist)
I'll just answer them in turn:
1)
No, there is no percentage of fair use.
2)
Nope, not that either. It's still the same source.
3)
Not if you copy it keystroke by keystroke (except the names).
4)
Yes, you need a patent to protect the algorithm (and even then certain algorithms will be hard to protect).
You could of course write exactly the same code by mistake. That is not a violation. But unless you can prove that you have written exactly the same code without ever looking at the source you are copying you will go down in court...
I have heard somewhere that the predicate has been tested for all numbers up to some big number (in the range of 10^12 i think).
For anyone that doesn't want to get themselves a login at New York Times you can use user:slashdot_wimp passwd:slashdot