Which among are not the results of computational theory?
Posted: Thu Jul 14, 2022 9:26 am
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
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