anonymous
  • anonymous
I am supposed to decide whether an arbitrary computer program finishes running or runs forever
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
chestercat
  • chestercat
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
of course it depends on the code you wrote..if it involve infinite loops then it may run forever otherwise not
anonymous
  • 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...
anonymous
  • anonymous
http://en.wikipedia.org/wiki/Halting_problem

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
thanks estudier
anonymous
  • anonymous
how would one go about writing a function for this?
anonymous
  • anonymous
"Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist."
anonymous
  • anonymous
i disagree
anonymous
  • anonymous
I will look forward to reading your paper on the subject....:-)
anonymous
  • anonymous
so long as anything can prove to be consistant, there is a function to it!
anonymous
  • anonymous
Well, you will have to disprove Turing's proof..
anonymous
  • anonymous
naturally
anonymous
  • anonymous
i come to dislike theoretical mathematics, its so abstract and almost irrelevant. Applied mathematics can be useful and amazingly beautiful as well.
anonymous
  • anonymous
There is proof that shows there is a total computable function that decides whether an arbitrary program i halts on arbitrary input x!
anonymous
  • anonymous
at least there should be.

Looking for something else?

Not the answer you are looking for? Search for more explanations.