Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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

Mathematics
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
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.

Join Brainly to access

this expert answer

SIGN UP FOR FREE
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...
http://en.wikipedia.org/wiki/Halting_problem

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

thanks estudier
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 disagree
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..
naturally
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.

Not the answer you are looking for?

Search for more explanations.

Ask your own question