Epstein Secrets

From: John Brockman < INIMI> To: Paul Allen , Sergey Brin Ginevra Elkann , John Doerr Tony Fadell Bill Gates Maja Hoffmann , Bill Joy , Daniel Kahneman Vinod Khosla , Milner Yuri Elon Musk , Nathan Myhrvold , Pierre Omid ar Page , Lori Park , Jean Pigozzi , "J.E. Safra" , Charles Simon , S

ear-old graduate student, not by building a computer, but by writing a purely mathematical paper, "On Computable Numbers, with an Application to the Entscheidungsproblem," published in 1936. The Decision Problem, articulated by Gottingen's David Hilbert, concerned the abstract mathematical question of whether there

mits on computational resources. The efficacy of human algorithms springs from what AI researchers refer to as “bounded optimality.” As psychologist Daniel Kahneman has notably pointed out, human beings are rational only up to a point. If you were perfectly rational, you would risk dropping dead before making an

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu

mits on computational resources. The efficacy of human algorithms springs from what AI researchers refer to as “bounded optimality.” As psychologist Daniel Kahneman has notably pointed out, human beings are rational only up to a point. If you were perfectly rational, you would risk dropping dead before making an

e. Turing contributed a fundamental model of computation—now known as a Turing Machine—in his paper “On Computable Numbers with an Application to the Entscheidungsproblem,” written and revised in 1936 and published in 1937. In these machines, a linear tape of symbols from a finite alphabet encodes the input for a compu