Open study

is now brainly

With Brainly you can:

  • Get homework help from millions of students and moderators
  • Learn how to solve problems with step-by-step explanations
  • Share your knowledge and earn points by helping other students
  • Learn anywhere, anytime with the Brainly app!

A community for students.

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

See more answers at
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.

Get this expert

answer on brainly


Get your free account and access expert answers to this and thousands of other questions

well what is the program description
before i proceed, what credentials do you have? if you dont mind me asking

Not the answer you are looking for?

Search for more explanations.

Ask your own question

Other answers:

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

Not the answer you are looking for?

Search for more explanations.

Ask your own question