01 January 1970 21 7K Report

Our answer is certainly YES.

Albeit, in spite of experiments, some supposedly highly-qualified people think that even quantum computing (QC) makes nothing unlimited.

They also say that due to (magical, no one defines it coherently) superposition, exponentially (and more) speed up algorithms can exist but … nobody has shown that it can indefinitely speed up algorithms.

What can one say to that? Would it be helpful to have a manuscript that shows things can be calculated unlimitedly? Only using B={0,1} ?

What is your qualified opinion?

More Ed Gerck's questions See All
Similar questions and discussions