Follow Slashdot stories on Twitter

 



Forgot your password?
typodupeerror
×

Comment Re:remote desktop vs windows (Score 1) 197

Well, assuming that the ssh admin has permitted ssh forwarding. And that you invoked your ssh client with the appropriate flags. And that you export the DISPLAY variable on the remote host. And that you set your xhost permissions on your own host.

Other than that, nothing to be done.

You mean

ssh -X user@host xterm?

Damn hard that is!

Comment Re:Can someone explain... (Score 1) 262

You can easily check if a factorization is correct using a conventional computer. Of course factorizing 15 is pretty useless in itself, but you have to start somewhere. To put things into perspective, assume you have a number with 1000 digits, and you want to factorize that. The best known conventional algorithm for doing that is the General Number Field Sieve with which the factorization would take in the order of 1.4 * 10^43 operations. Assuming you had a computer capable of executing a trillion operations per second it would still take about 4.6 * 10^23 years, which is 33 trillion times the age of the universe!

Now assume you had a quantum computer with enough qubits - we would need at least 3322 qubits. Let us say that it is otherwise a pretty crappy quantum computer as it only gets the factorization right 0.1% of the time. Now we try to use our quantum computer. It gives us an answer in the order of just a few billion operations. Even if it is quite slow and only capable of 1 million operations per second, it would still give an answer in less than an hour. This answer is probably wrong, however we can easily check that using our conventional computer. Checking if a number divides another is FAST. It can actually be done in slightly more than just the size of the input - the existence of a factor in a 1000 digit number would take the order of maybe 100,000 operations to check - in much less than a second.

So the time it takes to validate the answer is negligible here. We just keep on asking the quantum computer to try again until we get it right. So how long would it take? After 10000 tries we would have gotten the correct result with a probability of 99.995%. So if every try takes 1 hour, we would be pretty sure to have succeeded in less than a year (10000 hours = 1 year 1 month 21 days 6 hours). So even with this big but crappy quantum computer we would be able to factorize the integer in less than a year instead of 33 trillion times the age of the universe.

Comment Re:Only applies if static ctors are called clinit? (Score 1) 89

First the abstract as well as the summary of invention directly talks about functions in class files. Of course it's the claims that are really important here.
Claim 1-5 explicitly talks about a clinit method in a class file (2-5 builds on 1).
Claim 6-11 talks about determining what code does by "play executing" it (i.e. simulating) - I can't believe this doesn't have any sort of prior art - seems a lot like some more or less standard optimizations by compilers.
Claim 12-17: again here it's talking about clinit methods in class files
Claim 18-23: "A computer-readable medium containing instructions for controlling a data processing system to perform a method, comprising the steps of: ..." - I think they are claiming rights to create a program that implements claim 6-11 here?

Comment Only applies if static ctors are called clinit? (Score 2) 89

By skimming #6,061,520 it seems to me that google could go free from that one just by calling the static initializers something else than - I don't know if they already do that. But it somehow seems oddly specific that the patent explicitly says "clinit method(s)" instead of just saying static class constructors or something like that - like it's only targeting java without never mentioning java in the claims.

Slashdot Top Deals

Any circuit design must contain at least one part which is obsolete, two parts which are unobtainable, and three parts which are still under development.

Working...