Showing posts with label computability. Show all posts
Showing posts with label computability. Show all posts

Thursday, March 26, 2020

Quantum supremacy?

A Wafer of the D-Wave Quantum Computer.
By Steve Jurvetson from Menlo Park, USA

We have been speaking about quantum computers for a few decades. These computers would work with qubits (quantum bits) instead of bits, and would perform certain operations much faster than ordinary computers.
It has been known since the thirties that quantum computers cannot solve problems that cannot be solved by ordinary computers. Those problems are called non-computable. What they would do, in principle, is solve certain problems (not all) much faster than ordinary computers. That higher speed, which in some cases should be enormous, is called quantum supremacy.
Let's give an example: we know that the decomposition of a composite number into its prime factors can be difficult. It’s trivial if the factors are small, but if the composite number is the result of multiplying two prime numbers of 100 digits each (for example) it is almost impossible to break it down, if we don’t know ay least one of the prime numbers.

Thursday, January 9, 2020

The three laws of Robotics

Isaac Asimov

Isaac Asimov was a prolific science fiction and popular science writer who published in the 40s a series of stories about robots, later compiled in the I, Robot collection. In these stories he invented a word that has become a part of the technological vocabulary, as the name of a discipline: Robotics. He also formulated the three famous laws of Robotics, which in his opinion should be implemented in every robot to make secure our interactions with these machines that, when Asimov formulated the laws, were simple future forecasts.
The three laws of Robotics are the following:
First Law: A robot may not harm a human being, or through inaction allow a human being to come to harm.
Second Law: A robot must obey any order given by a human being, except those that conflict with the first law.
Third Law: A robot must protect its own existence as long as such protection does not conflict with the first two laws.

Thursday, September 26, 2019

The limits of quantum computing

Alan Turing
In an interview in a major Spanish newspaper (La Vanguardia) published on July 27, 2019, David Pérez García, a researcher in quantum physics, says this: We are just in the beginning of some technologies that we still don’t know how far they will go. He is right, because the future is hardly predictable, but when it comes to quantum computing we tend to think that these computers, if they are viable, will let us solve problems quite different from those that can be addressed by the traditional computers to which we are used. In this context, however, mathematics can help us distinguish between what can be done, and what is completely impossible.
Although quantum computing is a fairly modern concept, its theoretical foundation was established by Alan Turing during the 1930s. Let us review a little of what he showed, for in this way we can correct a few optimistic ideas spread by the media, often driven by experts who approach the issue from very different points of view, compared to Turing.