/explore
|
You are here 
|
blog.computationalcomplexity.org | ||
| | | | |
windowsontheory.org
(Also available as a pdf file. Apologies for the many footnotes, feel free to skip them.) Computational problems come in all different types and from all kinds of applications, arising from engineering as well the mathematical, natural, and social sciences, and involving abstractions such as graphs, strings, numbers, and more. The universe of potential algorithms... |
|
| | | | | ||
| | | | |
pressron.wordpress.com
Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... |
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
www.lesswrong.com
These are some research notes on whether we could reduce AI takeover risk by cooperating with unaligned AIs. I think the best and most readable publi... |
|
| | | |||
