Ask your own question, for FREE!
Mathematics 10 Online
OpenStudy (anonymous):

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

OpenStudy (anonymous):

ok?

OpenStudy (anonymous):

well what is the program description

OpenStudy (anonymous):

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

OpenStudy (anonymous):

im a computer sciene student

OpenStudy (anonymous):

so proceed to answer

OpenStudy (anonymous):

???

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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

OpenStudy (anonymous):

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.

OpenStudy (anonymous):

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

OpenStudy (anonymous):

tht was on wikipedia

OpenStudy (anonymous):

it basically proves what i was saying

OpenStudy (anonymous):

right

OpenStudy (anonymous):

its is in java if u dont understand tell me

OpenStudy (anonymous):

come again?

OpenStudy (anonymous):

all possible pairs cannot exist

OpenStudy (anonymous):

for this question to be solved

OpenStudy (anonymous):

hmmmm....

OpenStudy (anonymous):

ok next question

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!