is an unsolvable
problem of computer science
. It was identified long before the first computers. The unsolvabillity of the halting problem states:
"There exists no computable algorithm which, when given as input a program and an input to that program, can decide whether the program will halt or not."