3 ms·
Seems doable. Or better do a problem that is NP-Complete or in a highly parallelizable class. Essentially an analog computer. Some of the reason people want qu
by ljlolel 4y ago
Seems doable. Or better do a problem that is NP-Complete or in a highly parallelizable class.
Essentially an analog computer. Some of the reason people want quantum or DNA computers to exploit physical mechanisms beyond stacks of binary gates.
- pishpash 4y agoA (classical) analog computer is not a quantum computer and various conjectures on complexity say that they should all be efficiently (polynomial-time) simulated by a probabilistic Turing machine.