Redefining “Information”
A review of James Gleick's latest bestseller, The Information: A History, A Theory, A Flood.
Computer science
Evolving 2-CNF under uniform distribution
This paper extends the model of Darwinian evolution through computational learning, showing that the class of 2-CNF functions are evolvable when input variables are uniformly distributed.
Minimum assignment problem
Olga Zverovich, ‘10 Harvard University, Department of Mathematics “Does P=NP?” is one of the biggest open questions in theoretical computer science. An important advance toward answering this question came in 1971, when Stephen Cook proved that a problem in NP—the Satisfiability Problem, or simply SAT—has the property that if this problem is “easy” (polynomial-time solvable), then all problems in NP [...]