The Lounge is rated Safe For Work. If you're about to post something inappropriate for a shared office environment, then don't post it. No ads, no abuse, and no programming questions. Trolling, (political, climate, religious or whatever) will result in your account being removed.
Looking at ProjectEuler and the OEIS website, it seems that some programming languages offer shorter methods of doing something (mathematical) (and I'm not just talking about the obfuscatory syntax). One language that comes to mind is J; another is Maple. It seems that you can do a lot with just a few short calls. Why isn't that added to most languages? Is there a repository that adds the most optimal method to do something into a library for that language so that it may be used?
What is the longest running program? I assume the programs developed for Voyager 1 and 2 are pretty much up there. What other types are there? Is there a never-ending program that is calculating all the primes and storing them in a library somewhere?
Did you actually read him?... His haven't much more sense than yours
If something has a solution... Why do we have to worry about?. If it has no solution... For what reason do we have to worry about?
Help me to understand what I'm saying, and I'll explain it better to you
Rating helpful answers is nice, but saying thanks can be even nicer.
Is there a never-ending program that is calculating all the primes and storing them in a library somewhere?
well there was Deep Thought that determined the answer to life, the universe and everything ...but that did eventually complete.
Now [given the answer] they're trying to trying to figure out the ultimate question, however that will take a much larger computer.