Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

1234portion

  • 4 years ago

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

  • This Question is Open
  1. quarkine
    • 4 years ago
    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. 1234portion
    • 4 years ago
    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...

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

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

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

    thanks estudier

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

    how would one go about writing a function for this?

  6. estudier
    • 4 years ago
    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."

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

    i disagree

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

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

  9. 1234portion
    • 4 years ago
    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!

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

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

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

    naturally

  12. 1234portion
    • 4 years ago
    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.

  13. 1234portion
    • 4 years ago
    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!

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

    at least there should be.

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

    • Attachments:

Ask your own question

Sign Up
Find more explanations on OpenStudy
Privacy Policy