Quantcast

A community for students. Sign up today!

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

1234portion

  • 3 years ago

the halting problem, given a description of a computer program decide weather the program finishes running or continues to run forever

  • This Question is Closed
  1. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ok?

  2. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    well what is the program description

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

    before i proceed, what credentials do you have? if you dont mind me asking

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

    im a computer sciene student

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

    so proceed to answer

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

    ???

  7. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    ok if input and output produce a definite result and answer does not continue in a infinite loop or an infinite recursion process then it will have a output

  8. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    if after the program outputs a result and stop it has terminated

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

    Interesting answer, but consider the sketch of proof, The proof shows there is no total computable function that decides whether an arbitrary program i halts on arbitrary input x; that is, the following function h is not computable.

  10. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    procedure compute_g(i): if f(i,i) == 0 then return 0 else loop forever

  11. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    tht was on wikipedia

  12. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    it basically proves what i was saying

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

    right

  14. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    its is in java if u dont understand tell me

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

    come again?

  16. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    all possible pairs cannot exist

  17. hahd
    • 3 years ago
    Best Response
    You've already chosen the best response.
    Medals 0

    for this question to be solved

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

    hmmmm....

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

    ok next question

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

    • Attachments:

Ask your own question

Ask a Question
Find more explanations on OpenStudy

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.