Ask your own question, for FREE!
Mathematics 7 Online
OpenStudy (anonymous):

I am supposed to decide whether an arbitrary computer program finishes running or runs forever

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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...

OpenStudy (anonymous):

http://en.wikipedia.org/wiki/Halting_problem

OpenStudy (anonymous):

thanks estudier

OpenStudy (anonymous):

how would one go about writing a function for this?

OpenStudy (anonymous):

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

OpenStudy (anonymous):

i disagree

OpenStudy (anonymous):

I will look forward to reading your paper on the subject....:-)

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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

OpenStudy (anonymous):

naturally

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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

OpenStudy (anonymous):

at least there should be.

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!