Explore >> Select a destination
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
scottaaronson.blog
|
|
| | | | | The Blog of Scott Aaronson | |
| | | | |
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. | |
| | | | |
www.scottaaronson.com
|
|
| | | | | ||
| | | | |
wavewatching.wordpress.com
|
|
| | | Everybody who is following the Quantum Computing story will have heard by now about IBM's new chip. This certainly gives credence to the assumption that superconducting Josephon junction-based technology will win the race. This may seem like bad news for everybody who was hoping to be able to tug away a quantum... | ||
