Its actually pretty common right now. I work in the Fibre Channel industry, and most new Fibre switches have a built in web server, which actually serves up Java applets to manage the switch. Pretty soon we'll be seeing toaster and coffee machines doing the same thing...
I doubt it. There aren't enough big companies with record-shattering IPOs promoting it. There's alot of overhead with selling a new OS onto one of these big OEM systems (compatibility testing, driver support, customer support, marketing, etc etc), so its hardly worth it unless (a) customers demand it ALOT, or (b) a monopoly forces you to do it, lest they crush you like a bug.
2000-06-15 15:02:44 x86 Obsolete? (articles,hardware) (accepted)
strangely enough, it took almost 24 hours from acceptance to actually being posted. wierd.
Re:Why does Internet Explorer run all the time?
on
Mattel Spyware
·
· Score: 1
It's integrates with the OS!:)
About Quake3's serial numbers....
on
Copyrant
·
· Score: 2
Interestingly enough, this turned into a big problem for Id when someone figured out how to fake the keys. People who bought legit copies found themselve unable to play because their 'unique number' was already in use? SWo did this clever scheme stop piracy? NO - NOT AT ALL. Did it inconvience alot of legitimate customers? YES. So much so that I believe future patches to Quake3 disabled this brain-damaged serial number check.
1. Claim to be running a web server off a Palm Pilot, furby, Commodore 64, or even a bunch of potatoes. (Bonus points if its a port of Apache).
2. Write an article on DeCSS, Napster, MPAA, RIAA, and/or Metallica.
3. Publish a benchmark comparison of Linux and Windows, making sure that Windows scores best in all categories. (Bonus points if your test team is made up of 12 MCSEs and 1 dude who installed Red Hat 5.2 once before).
4. Title your article "X Violating the GPL?" It doesn't matter what the article actually says; it could just be a description of ancient Bulgarian goat herding. You're sure to get all the Slashdotters riled up regardless.
5. Write something about "Geek Sex".
6. Produce blurry, unenlightening satellite pictures of a secret government compound. Bonus points if the site mysteriously disappears in a few hours - the paranoid Slashdotters will have a field day with that one.
Not even. The main advantage of quantum computing is massive parallelism. If the algorithm its running is still NP-hard, its still going to be slower than a polynomial time algorithm. Fundamentally, a quantum computer is still just a Turing Machine.
That's my point. If P=NP, we are suddenly in some very deep trouble. However, if we can prove P!=NP (which is basically what all of computer sceince has been assuming for 30+ years), we still have lots of other questions to tackle.
Not necessarily... Turing Machines aren't necessarily powerful, they are just the bare minumum you need to solve any computable problem. Even your brand-spanking-new Athlon 1Ghz is still, theoretically at least, a (deterministic) Turing Machine. Anything one can do, the other can do, in the same amount of time (poly time versus non-det poly time). NP problems run in poly time, but on a non-deterministic Turing Machine. So stating that "problems that are non-polynomial on TMs might turn out to be polynomial somewhere else" is pretty meaningless; the only machine any such problem will run in poly time on is a non-deterministic machine, which to the best of my knowledge we don't have any of.
I've been fascinated with P=NP for a long time now. If, in fact, P=NP, then a whole lotta computer-oriented things are gonna change, probably for the worse. For example, standard RSA encryption will pretty much be useless, since at its core it depends on P!=NP. So, I'm just curious - what's the/. community's take on P=NP? Is it true or false (in your humble opinions)? If its true, what are the consequences?
Not really... 98.5 on your radio dial = 98.5 Mhz = 98500000 hertz. You can divide any smaller than a hertz.
I agree :) However the Java involved is client-side only, for interfacing with the switch.
Its actually pretty common right now. I work in the Fibre Channel industry, and most new Fibre switches have a built in web server, which actually serves up Java applets to manage the switch. Pretty soon we'll be seeing toaster and coffee machines doing the same thing...
gratuitous talking heads reference?
Great. It really sucked when the Sun was running NT. Those BSODs really ruined my day.
Okay, I agree Linux is great and all, but replacing the Sun?? Isn't that a bit ambitious?
Intellimouse
Lets find the Karma gene! I bet we could extract it from Signal 11. And while we're at it, lets eliminate the Troll and Flamebait genes.
I doubt it. There aren't enough big companies with record-shattering IPOs promoting it. There's alot of overhead with selling a new OS onto one of these big OEM systems (compatibility testing, driver support, customer support, marketing, etc etc), so its hardly worth it unless (a) customers demand it ALOT, or (b) a monopoly forces you to do it, lest they crush you like a bug.
So someone installed Linux onto what used to be a Windows box, and the first thing the managers noticed was the uptime? Um, ok.
The main page is http://www.vvisions.com/terminus/, not http://www.vvision.com/terminus/.
i beat you to it :)
2000-06-15 15:02:44 x86 Obsolete? (articles,hardware) (accepted)
strangely enough, it took almost 24 hours from acceptance to actually being posted. wierd.
It's integrates with the OS! :)
Interestingly enough, this turned into a big problem for Id when someone figured out how to fake the keys. People who bought legit copies found themselve unable to play because their 'unique number' was already in use? SWo did this clever scheme stop piracy? NO - NOT AT ALL. Did it inconvience alot of legitimate customers? YES. So much so that I believe future patches to Quake3 disabled this brain-damaged serial number check.
Its not that impressivwe, about 3.5 MB/s. It'd probably be far cheaper just to FedEx hard drives to the theatres.
Here's a far better English version of the Tom's Hardware article
1. Claim to be running a web server off a Palm Pilot, furby, Commodore 64, or even a bunch of potatoes. (Bonus points if its a port of Apache).
2. Write an article on DeCSS, Napster, MPAA, RIAA, and/or Metallica.
3. Publish a benchmark comparison of Linux and Windows, making sure that Windows scores best in all categories. (Bonus points if your test team is made up of 12 MCSEs and 1 dude who installed Red Hat 5.2 once before).
4. Title your article "X Violating the GPL?" It doesn't matter what the article actually says; it could just be a description of ancient Bulgarian goat herding. You're sure to get all the Slashdotters riled up regardless.
5. Write something about "Geek Sex".
6. Produce blurry, unenlightening satellite pictures of a secret government compound. Bonus points if the site mysteriously disappears in a few hours - the paranoid Slashdotters will have a field day with that one.
... all out of ideas... anyone else?
reminds me of this
Not even. The main advantage of quantum computing is massive parallelism. If the algorithm its running is still NP-hard, its still going to be slower than a polynomial time algorithm. Fundamentally, a quantum computer is still just a Turing Machine.
That's my point. If P=NP, we are suddenly in some very deep trouble. However, if we can prove P!=NP (which is basically what all of computer sceince has been assuming for 30+ years), we still have lots of other questions to tackle.
Not necessarily... Turing Machines aren't necessarily powerful, they are just the bare minumum you need to solve any computable problem. Even your brand-spanking-new Athlon 1Ghz is still, theoretically at least, a (deterministic) Turing Machine. Anything one can do, the other can do, in the same amount of time (poly time versus non-det poly time). NP problems run in poly time, but on a non-deterministic Turing Machine. So stating that "problems that are non-polynomial on TMs might turn out to be polynomial somewhere else" is pretty meaningless; the only machine any such problem will run in poly time on is a non-deterministic machine, which to the best of my knowledge we don't have any of.
I've been fascinated with P=NP for a long time now. If, in fact, P=NP, then a whole lotta computer-oriented things are gonna change, probably for the worse. For example, standard RSA encryption will pretty much be useless, since at its core it depends on P!=NP. So, I'm just curious - what's the /. community's take on P=NP? Is it true or false (in your humble opinions)? If its true, what are the consequences?
offtopic, but, heres the info on freecell
Ok, so when are we gonna see a slashcode port to PalmOS?
quick, copyright that before you see it during the next superbowl....