By KM
Published Jun 19
8 cards
Grid View
/
This is a published deck. Feel free look around, review cards, or make changes, but you'll need to clone it to save your progress.
9.8.0 How does Shor’s algorithm work? What does it do?
3 hidden sides
New
9.7.0 Reality is quantum: matter is discrete. Then, how can something that is only either 0 or 1 jump from one state to another?
1 hidden side
New
9.6.0 How unpredictability and intractability can affect the universality of computation and simulation?
3 hidden sides
New
9.5.0 Are all quantum experiments random and make only probabilistic predictions?
3 hidden sides
New
9.4.0 What is the chaos theory? How it explains classical unpredictability?
11 hidden sides
New
9.3.0 What is the fundamental question of the computation complexity theory?
3 hidden sides
New
9.2.0 Many people criticize the universality of computation (and virtual-reality rendering) for its impracticality. It is a highly abstract concept, and its ‘in principle’ effects are miniscule in real-life (because no object has infinite time or memory). Hence, it is not a profound property of reality. What counterargument David provides and what are its implications?
1 hidden side
New
9.1.0 What is a quantum computer? What makes it a distinctly different paradigm of computation?
1 hidden side
New