Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
I am supposed to decide whether an arbitrary computer program finishes running or runs forever
 one year ago
 one year ago
I am supposed to decide whether an arbitrary computer program finishes running or runs forever
 one year ago
 one year ago

This Question is Open

quarkineBest ResponseYou've already chosen the best response.0
of course it depends on the code you wrote..if it involve infinite loops then it may run forever otherwise not
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
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...
 one year ago

estudierBest ResponseYou've already chosen the best response.1
http://en.wikipedia.org/wiki/Halting_problem
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
how would one go about writing a function for this?
 one year ago

estudierBest ResponseYou've already chosen the best response.1
"Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible programinput pairs cannot exist."
 one year ago

estudierBest ResponseYou've already chosen the best response.1
I will look forward to reading your paper on the subject....:)
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
so long as anything can prove to be consistant, there is a function to it!
 one year ago

estudierBest ResponseYou've already chosen the best response.1
Well, you will have to disprove Turing's proof..
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
i come to dislike theoretical mathematics, its so abstract and almost irrelevant. Applied mathematics can be useful and amazingly beautiful as well.
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
There is proof that shows there is a total computable function that decides whether an arbitrary program i halts on arbitrary input x!
 one year ago

1234portionBest ResponseYou've already chosen the best response.0
at least there should be.
 one year ago
See more questions >>>
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.