Question

Which among are not the results of computational theory?

(a) In general, it is impossible to predict that what a Turing-complete program will do over an arbitrarily long time.

(b) It is impossible to determine for every input, whether the program will eventually stop or continue forever.

(c) It is not possible to determine whether a program will return true or false.

(d) None of the mentioned

I had been asked this question in a national level competition.

My question is from Simulation of Turing Machine in chapter Introduction to Turing Machines of Automata Theory

Answer 1

Correct choice is (d) None of the mentioned

For explanation: All of the following mentioned are the conclusions of automata theory or computability theory.