A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing
 3 years ago
the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!
 3 years ago
the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!

This Question is Closed

Owlfred
 3 years ago
Best ResponseYou've already chosen the best response.01234, 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.

faiona
 3 years ago
Best ResponseYou've already chosen the best response.0no program runs forever, is this about the philosopher's paradox?

1234portion
 3 years ago
Best ResponseYou've already chosen the best response.0i want to see you postulate possible value for a total computable function fiona!

1234portion
 3 years ago
Best ResponseYou've already chosen the best response.0what is your approach?

faiona
 3 years ago
Best ResponseYou've already chosen the best response.0to not misspell people's nicknames is a good one

1234portion
 3 years ago
Best ResponseYou've already chosen the best response.0i see wikipedia has answer?

faiona
 3 years ago
Best ResponseYou've already chosen the best response.0yup.maybe çause it's hAlting not hAUlting :)

1234portion
 3 years ago
Best ResponseYou've already chosen the best response.0can i see how you would approach this problem?

1234portion
 3 years ago
Best ResponseYou've already chosen the best response.0i want to asses your aptitude

faiona
 3 years ago
Best ResponseYou've already chosen the best response.0I specialize in databases, so likely by turning it over to a developer

jsba928
 3 years ago
Best ResponseYou've already chosen the best response.1The 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.
Ask your own question
Ask a QuestionFind 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
 Engagement 19 Mad Hatter
 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.