anonymous
  • anonymous
the halting problem, given a description of a computer program decide weather the program finishes running or continues to run forever
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
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.
schrodinger
  • schrodinger
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
ok?
anonymous
  • anonymous
well what is the program description
anonymous
  • anonymous
before i proceed, what credentials do you have? if you dont mind me asking

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
im a computer sciene student
anonymous
  • anonymous
so proceed to answer
anonymous
  • anonymous
???
anonymous
  • 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
anonymous
  • anonymous
if after the program outputs a result and stop it has terminated
anonymous
  • 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.
anonymous
  • anonymous
procedure compute_g(i): if f(i,i) == 0 then return 0 else loop forever
anonymous
  • anonymous
tht was on wikipedia
anonymous
  • anonymous
it basically proves what i was saying
anonymous
  • anonymous
right
anonymous
  • anonymous
its is in java if u dont understand tell me
anonymous
  • anonymous
come again?
anonymous
  • anonymous
all possible pairs cannot exist
anonymous
  • anonymous
for this question to be solved
anonymous
  • anonymous
hmmmm....
anonymous
  • anonymous
ok next question

Looking for something else?

Not the answer you are looking for? Search for more explanations.