Bounding Rationality With Computation (episode 260)
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 live on the Internet from 12:00 noon to 5:00 pm every weekday afternoon, Hawaii Time, then streaming earlier shows through the night. Check us out any time for great content and great community.
Our vision is to be a leader in shaping a more vital and thriving Hawaii as the foundation for future generations. Our mission is to be the leading digital media platform raising pubic awareness and promoting civic engagement in Hawaii.