Martin Davis and the Logic of a Checkable Plan
Martin Davis spent much of his life asking which questions a machine could settle. As a student in New York, he took up a problem about equations that would occupy him for decades. In 1962 he and two colleagues described a machine that could pursue a line of reasoning, recognise a contradiction and retrieve an earlier decision from magnetic tape. That work helped establish a method for finding out whether a set of logical conditions can all hold at once. Decades later, researchers in artificial intelligence used that question to find plans. A sequence of actions had to lead from a stated starting point to a goal while obeying the rules at every step. Davis’s career offers a way to understand both the force of a proof and the care needed in deciding what, exactly, has been proved.
Martin Davis and the Logic of a Checkable Plan Leer más »









