Jay Fidell and Richard Melendez highlight a talk given by Lance Fortnow, at the Computability, Complexity, and Randomness Conference. Lance’s talk covered his on the work with the P vs. NP problem. Original Air Date January 17, 2016. Episode 260. Nicole Hori attended the talk and spoke to Robert Downey and Quinn Culver. ThinkTechHawaii.com streams […]