Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
mycqstate.wordpress.com
|
|
| | | | | A couple months from nowDorit Aharonov,David Gossetand myself will be giving a short 3.5-day "Spring School" that is meant to be an introduction to recent topics in quantum computing, directed at young researchers in theoretical computer science at large. Theschoolis organized by Shachar Lovett at the University of California in San Diego, from March 19th... | |
| | | | |
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. | |
| | | | |
terrytao.wordpress.com
|
|
| | | | | [This post is dedicated to Luca Trevisan, who recently passed away due to cancer. Though far from his most significant contribution to the field, I would like to mention that, as with most of my ot... | |
| | | | |
www.nature.com
|
|
| | | The theory of the strong force, quantum chromodynamics, describes the proton in terms of quarks and gluons. The proton is a state of two up quarks and one down quark bound by gluons, but quantum theory predicts that in addition there is an infinite number of quark-antiquark pairs. Both light and heavy quarks, whose mass is respectively smaller or bigger than the mass of the proton, are revealed inside the proton in high-energy collisions. However, it is unclear whether heavy quarks also exist as a part o... | ||
