## 1234portion 3 years ago I am supposed to decide whether an arbitrary computer program finishes running or runs forever

• This Question is Open
1. quarkine

of course it depends on the code you wrote..if it involve infinite loops then it may run forever otherwise not

2. 1234portion

i believe the difficulty in the problem lies in the requirement that the decision procedure must work for all programs and input a particular program either halts on a given input or does not halt...

3. estudier
4. 1234portion

thanks estudier

5. 1234portion

how would one go about writing a function for this?

6. estudier

"Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist."

7. 1234portion

i disagree

8. estudier

9. 1234portion

so long as anything can prove to be consistant, there is a function to it!

10. estudier

Well, you will have to disprove Turing's proof..

11. 1234portion

naturally

12. 1234portion

i come to dislike theoretical mathematics, its so abstract and almost irrelevant. Applied mathematics can be useful and amazingly beautiful as well.

13. 1234portion

There is proof that shows there is a total computable function that decides whether an arbitrary program i halts on arbitrary input x!

14. 1234portion

at least there should be.