rafaeldff + transcript   4

Shtetl-Optimized » Blog Archive » What Google Won’t Find
Interesting non-technical article on the relation between NP-completeness and quantum computing. It also touches on the nature of the relationship between physics and the P=NP problem.
article  ScottAaronson  blog  post  computing  computerscience  mathematics  physics  P=NP  problem  math  quantum  complexity  lecture  transcript 
august 2007 by rafaeldff

Copy this bookmark:



description:


tags: