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

the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!

  • 2 years ago
  • 2 years ago

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

    1234, mind if I ask you a couple questions. I see you're a new user and want to get your thoughts on some things about OpenStudy.

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

    sure why not?

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

    i have a concern

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

    no program runs forever, is this about the philosopher's paradox?

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

    for you owlfred

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

    no faiona

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

    Are you a student now?

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

    i want to see you postulate possible value for a total computable function fiona!

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

    what is your approach?

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

    to not misspell people's nicknames is a good one

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

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

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

    pardon

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

    oh!!!

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

    i see wikipedia has answer?

    • 2 years ago
  15. faiona Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    yup.maybe çause it's hAlting not hAUlting :)

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

    can i see how you would approach this problem?

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

    faiona

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

    i want to asses your aptitude

    • 2 years ago
  19. faiona Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    I specialize in databases, so likely by turning it over to a developer

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

    are you a student?

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

    ??

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

    The thing to realize is that the Halting Problem, technically undecidable, is basically theoretical not practical. It doesn't really connect well to the "real world" of computing. In reality, if a program seems to just keep running forever thats generally because it contains an infinite loop or has hung on some bad input. A recursive routine that does not contain a stopping condition will execute for quite a long time but will eventually eat up all the computer's stack space and crash, terminating the program. An infinite loop can technically run forever, provided it makes no changes to data stored in the computer's memory.

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