Tag Archives: prime factorisation
Elementary P v. NP
One episode of the TV show ‘Elementary’ involves three mathematicians and a race to solve the P-versus-NP problem. Continue reading
Posted in Uncategorized
Tagged computational complexity, deus ex machina, Elementary, Joan Watson, P versus NP, prime factorisation, Riemann hypothesis, Robert Lipton, Scott Aaronson, Sherlock Holmes
Comments Off on Elementary P v. NP