Well, that's a quote, not a citation, but it's more than I expected.:neutral:

Where is any implication that IBM developed the transistor? Apparently the esoteric point (ie objectives of fundamental research verses creating a useful products) was overlooked.

Google has done something that other once successful companies did and do no more - ie GM, Sears, Xerox, and GE. And the so many that are now gone because they stopped doing it - ie Kodak, CDC, Unisys, ship builders, TWA, Pullman, AT&T, Goodrich, Polaroid, and various steel manufacturers.

Gravdigr's citation makes a same point. That point was quoted.

With the exception of a break-up, those companies were so stupid as to believe they were supposed to be profitable.

They should have consulted The TW, they might still be in business. Stupid multibillion dollar, multinational corporations.:headshake

How do they know it's the right answer?

Ah, shit. Now we're gonna hafta wait ten thousand years...

Sometimes you can check something very quickly that can take a long time to figure out... a reverse-hash, for example.

Ungrind the Corned Beef? :drummer:
I give up what is reverse hash?

Ya smoke it and ya get straight.

LOL

That link says you can't reverse hash so a reverse hash is imaginary? :confused:

And backwards?:eek:

If you have information that's been hashed, let's say a password, it can't be reverse hashed; but, you can go about hashing every password imaginable (a.k.a. brute force attack) until you get a matching hash result. Then you'll have discovered the password that was hashed.

Starting with a known password, hashing it; then, putting different kinds of computers through the discovery process, you can see how long the different computers take to come up with matching hash results. You can verify the accuracy of the result since you know the password that was hashed to begin with.

You already know what the right answer is whether it takes 200 seconds for a quantum computer; or, would take 10,000 years for the fastest current supercomputer, doing so-called reverse hashing, to spit out a match.

Ah so. Thank you.

An example. Take the phrase "ABCD". It is described by the number 61626364. Divide that number by a prime. The resulting encryption might be 635323 and 33.

Did that encryption algorithm work? Trying to reserve the hash using brute force takes long. Reversing the hash to check it is fast.

635323 times 97 is 61626331. Add 33 to confirm 61626364.

In this case, a reverse hash can easily verify the hash.

Rumors from observation claim that every Freecell game is winnable. But it has not been proven. The brute force method is to play every possible game. But no reverse process can prove that conclusion.

Some solutions are easily confirmed by reversing the process. Others are not.
.

IBM et al are not criticizing the Google machine (as so many assumed due to conclusions from soundbyte reasoning). They are criticizing a calculation that a conventional super computer could take 10,000 years to solve that problem. That conclusion assumed limited memory. With expanded memory, IBM, et al conclude the problem could be solved in 2.5 days. Using quantum computing, then not so much conventional memory is necessary.

Simple another step in the process of taking a theory, through fundamental research, into application research, and then into commercial products.