Explore >> Select a destination
|
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... | |
| | | | |
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... | |
| | | | |
cacm.acm.org
|
|
| | | | | [AI summary] The article discusses the ongoing evolution of the P vs NP problem in computational complexity theory, emphasizing its profound implications for algorithm design, cryptography, and artificial intelligence. It highlights how advances in machine learning and quantum computing are reshaping our understanding of computational limits, while also cautioning against the potential misuse of algorithms in areas like algorithmic bias and surveillance. The piece concludes by reflecting on the philosophical and practical significance of P vs NP, suggesting that its resolution could redefine the boundaries of what is computationally feasible. | |
| | | | |
yuxi.ml
|
|
| | | The hole argument in general relativity is formally analogous to the inverted qualia problem in philosophy. Like how spacetime points have no existence beyond gauge freedom, qualias have no existence beyond their geometric-functional roles, thus dissolving the hard problem of consciousness. | ||
