On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass,
their quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of
traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI can
be speeded up by making some gross heuristic approximations that are
usually true. Ignoring almost irrelevant noisy information may work.
Nothing can surpass an N bit quantum computer for factoring products of impossibly long primes. [snip...]
Researchers show classical computers can keep up with, and surpass, their quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of traditional computing
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass,
their quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of
traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI
can be speeded up by making some gross heuristic approximations that
are usually true. Ignoring almost irrelevant noisy information may work.
Nothing can surpass an N bit quantum computer for factoring products
of impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
On 12/02/2024 10:41, Jeroen Belleman wrote:
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass, their >>>> quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of >>>> traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI can be >>> speeded up by making some gross heuristic approximations that are usually >>> true. Ignoring almost irrelevant noisy information may work.
Nothing can surpass an N bit quantum computer for factoring products of
impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
I remain unconvinced that quantum computers can be made reliable enough to do anything remotely useful in the real world. OTOH they have been making real progress and today's mobile phones look like magic compared to the big iron of
yesteryear. My first mainframe IBM 370/165 had a whopping 4MB of main memory and you had to get a special ticket to use more than 500k at once. Algebra systems wouldn't run in less than 2MB.
On 2/12/2024 4:18 AM, Martin Brown wrote:
On 12/02/2024 10:41, Jeroen Belleman wrote:
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass,
their quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy >>>>> of traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI
can be speeded up by making some gross heuristic approximations that
are usually true. Ignoring almost irrelevant noisy information may
work.
Nothing can surpass an N bit quantum computer for factoring products
of impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
I remain unconvinced that quantum computers can be made reliable
enough to do anything remotely useful in the real world. OTOH they
have been making real progress and today's mobile phones look like
magic compared to the big iron of yesteryear. My first mainframe IBM
370/165 had a whopping 4MB of main memory and you had to get a special
ticket to use more than 500k at once. Algebra systems wouldn't run in
less than 2MB.
Predicting that something "can't" be done/happen is usually folly.
Predicting that something WON'T (volition) be done is a safer bet.
On 2/12/24 18:34, Don Y wrote:
On 2/12/2024 4:18 AM, Martin Brown wrote:[...]
On 12/02/2024 10:41, Jeroen Belleman wrote:
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass, their
quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of >>>>>> traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI can be
speeded up by making some gross heuristic approximations that are usually >>>>> true. Ignoring almost irrelevant noisy information may work.
Nothing can surpass an N bit quantum computer for factoring products of >>>>> impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
I remain unconvinced that quantum computers can be made reliable enough to >>> do anything remotely useful in the real world. OTOH they have been making >>> real progress and today's mobile phones look like magic compared to the big >>> iron of yesteryear. My first mainframe IBM 370/165 had a whopping 4MB of >>> main memory and you had to get a special ticket to use more than 500k at >>> once. Algebra systems wouldn't run in less than 2MB.
Predicting that something "can't" be done/happen is usually folly.
Predicting that something WON'T (volition) be done is a safer bet.
What will probably happen is that quantum computing will fail
to live up to expectations and at some point, funding will run
dry.
On 2/12/2024 4:18 AM, Martin Brown wrote:
On 12/02/2024 10:41, Jeroen Belleman wrote:
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and surpass, their >>>>> quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy of >>>>> traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI can be >>>> speeded up by making some gross heuristic approximations that are usually >>>> true. Ignoring almost irrelevant noisy information may work.
Nothing can surpass an N bit quantum computer for factoring products of >>>> impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
I remain unconvinced that quantum computers can be made reliable enough to do
anything remotely useful in the real world. OTOH they have been making real >> progress and today's mobile phones look like magic compared to the big iron of
yesteryear. My first mainframe IBM 370/165 had a whopping 4MB of main memory >> and you had to get a special ticket to use more than 500k at once. Algebra >> systems wouldn't run in less than 2MB.
Predicting that something "can't" be done/happen is usually folly.
Predicting that something WON'T (volition) be done is a safer bet.
My first AI course (mid 70's) predicted it would be "about 10 years"
for AI to be practical. That prediction was repeated "about every
10 years" and came to be a bit of a standing joke.
Now, almost "suddenly", it's "here" (in a particular form) and
folks are unprepared for it (both to exploit it and safeguard
against it).
Not only is it available but it is also ACCESSIBLE (early predictions
treated it as an "ivory tower" sort of technology; clearly not something
that Joe Average User could access!)
On 2/12/24 18:34, Don Y wrote:
On 2/12/2024 4:18 AM, Martin Brown wrote:[...]
On 12/02/2024 10:41, Jeroen Belleman wrote:
On 2/12/24 11:24, Martin Brown wrote:
On 12/02/2024 05:26, Jan Panteltje wrote:Entirely hypothetical. My expectation is that quantum computers
Researchers show classical computers can keep up with, and
surpass, their quantum counterparts
https://www.sciencedaily.com/releases/2024/02/240209134402.htm
Researchers adopt innovative method to boost speed and accuracy >>>>>> of traditional computing
It is a bold claim but not backed up by any convincing evidence.
I can believe that classical computing and in particular NN type AI
can be speeded up by making some gross heuristic approximations
that are usually true. Ignoring almost irrelevant noisy information
may work.
Nothing can surpass an N bit quantum computer for factoring
products of impossibly long primes. [snip...]
will never be able to factor numbers with prime factors much beyond
10^18 or so, if even that.
I remain unconvinced that quantum computers can be made reliable
enough to do anything remotely useful in the real world. OTOH they
have been making real progress and today's mobile phones look like
magic compared to the big iron of yesteryear. My first mainframe IBM
370/165 had a whopping 4MB of main memory and you had to get a
special ticket to use more than 500k at once. Algebra systems
wouldn't run in less than 2MB.
Predicting that something "can't" be done/happen is usually folly.
Predicting that something WON'T (volition) be done is a safer bet.
What will probably happen is that quantum computing will fail
to live up to expectations and at some point, funding will run
dry.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 415 |
Nodes: | 16 (2 / 14) |
Uptime: | 108:15:04 |
Calls: | 8,692 |
Calls today: | 1 |
Files: | 13,257 |
Messages: | 5,948,381 |