he states that the turing machine is the most general form of computer. a. the subset sum theorem b. kentucky-turing theorem c. church-turing thesis d. extra-crispy lemma 16. Accept and reject states of a turing machine are a. exactly the same b. non-absorbing states c. looping configurations d. halting configurations 17. A decidable language is a. context free b. regular c. turing recognizable d. all of the above 18. A regular language is a. decidable b. context free c. turing recognizable d. all of the above 19. ATM is a. decidable b. undecidable c. co-turing decidable d. turing unintelligible 20. Which of the following is not in class P a. element uniqueness b. PATH d. HAMPATH