Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
www.jeremykun.com
|
|
| | | | | Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility. | |
| | | | |
windowsontheory.org
|
|
| | | | | (see also pdf version) Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question,... | |
| | | | |
rjlipton.com
|
|
| | | | | Further discussions of the proof that factoring is in BQP Scott Aaronson is a, if not the, world expert on quantum computation. He writes, as you all know, one of the best blogs on quantum and many more things. Today I and Ken want to make a short summary on the last discussion: is factoring... | |
| | | | |
blog.cofree.coffee
|
|
| | | |||
