Original: This is equivalent to the problem of deciding , given a program and an input , whether the program will eventually halt when run with that input , or will run forever .
Simplified: This is the paper where Turing defines Turing machines , formulates the halting problem , and shows that it ( as well as the Entscheidungsproblem ) is unsolvable .