Functional Programming, Programming, Programming Languages.
Turing showed that it was impossible to compute whether a turing machine would halt for any program-input pair. To explain further, consider the below programs. 1) a = 1 + 3 2) while (True): print ‘hello’ While the first statement terminates, the second one doesn’t. These are trivial programs,