At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
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.
sure why not?
i have a concern
no program runs forever, is this about the philosopher's paradox?
for you owlfred
Are you a student now?
i want to see you postulate possible value for a total computable function fiona!
what is your approach?
to not misspell people's nicknames is a good one
i see wikipedia has answer?
yup.maybe çause it's hAlting not hAUlting :)
can i see how you would approach this problem?
i want to asses your aptitude
I specialize in databases, so likely by turning it over to a developer
are you a student?
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.