What is a accepting computation history?
An accepting computation history is explained as , Let M be a Turing machine and w be a input string, for M on w is a sequence of configuration c1,c2,...cl, Where c1 is the start configuration of M onw . cl is the accepting configuration of M and every ci legally follows from ci-1 according to the rules of M.