1234portion
the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!
Delete
Share
This Question is Closed
Owlfred
Best Response
You've already chosen the best response.
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.
1234portion
Best Response
You've already chosen the best response.
0
sure why not?
1234portion
Best Response
You've already chosen the best response.
0
i have a concern
faiona
Best Response
You've already chosen the best response.
0
no program runs forever, is this about the philosopher's paradox?
1234portion
Best Response
You've already chosen the best response.
0
for you owlfred
1234portion
Best Response
You've already chosen the best response.
0
no faiona
Owlfred
Best Response
You've already chosen the best response.
0
Are you a student now?
1234portion
Best Response
You've already chosen the best response.
0
i want to see you postulate possible value for a total computable function fiona!
1234portion
Best Response
You've already chosen the best response.
0
what is your approach?
faiona
Best Response
You've already chosen the best response.
0
to not misspell people's nicknames is a good one
1234portion
Best Response
You've already chosen the best response.
0
pardon
1234portion
Best Response
You've already chosen the best response.
0
oh!!!
1234portion
Best Response
You've already chosen the best response.
0
i see wikipedia has answer?
faiona
Best Response
You've already chosen the best response.
0
yup.maybe çause it's hAlting not hAUlting :)
1234portion
Best Response
You've already chosen the best response.
0
can i see how you would approach this problem?
1234portion
Best Response
You've already chosen the best response.
0
faiona
1234portion
Best Response
You've already chosen the best response.
0
i want to asses your aptitude
faiona
Best Response
You've already chosen the best response.
0
I specialize in databases, so likely by turning it over to a developer
1234portion
Best Response
You've already chosen the best response.
0
are you a student?
1234portion
Best Response
You've already chosen the best response.
0
??
jsba928
Best Response
You've already chosen the best response.
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.