Programming language based on state logic is an efficient，useful and practi-cal，new pure logical programming language with sound theoretical foundation．It can represent recursion and iteration．With reeursion its computability can be provided．This pa-per proves that partial recursive functions can be computed only with iteration programs in state logic．It means that any computable object in Turing machine can be defined itera tively and computed efficiently with Pure logic．