Here's the question you clicked on:
1234portion
I am supposed to decide whether an arbitrary computer program finishes running or runs forever
of course it depends on the code you wrote..if it involve infinite loops then it may run forever otherwise not
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...
how would one go about writing a function for this?
"Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist."
I will look forward to reading your paper on the subject....:-)
so long as anything can prove to be consistant, there is a function to it!
Well, you will have to disprove Turing's proof..
i come to dislike theoretical mathematics, its so abstract and almost irrelevant. Applied mathematics can be useful and amazingly beautiful as well.
There is proof that shows there is a total computable function that decides whether an arbitrary program i halts on arbitrary input x!
at least there should be.