Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

1234portion Group Title

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

  • 2 years ago
  • 2 years ago

  • This Question is Open
  1. quarkine Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

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

    • 2 years ago
  2. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 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...

    • 2 years ago
  3. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

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

    • 2 years ago
  4. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    thanks estudier

    • 2 years ago
  5. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    how would one go about writing a function for this?

    • 2 years ago
  6. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

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

    • 2 years ago
  7. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    i disagree

    • 2 years ago
  8. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

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

    • 2 years ago
  9. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

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

    • 2 years ago
  10. estudier Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

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

    • 2 years ago
  11. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    naturally

    • 2 years ago
  12. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

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

    • 2 years ago
  13. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

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

    • 2 years ago
  14. 1234portion Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    at least there should be.

    • 2 years ago
    • Attachments:

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

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.