A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 5 years ago
the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!
anonymous
 5 years ago
the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!

This Question is Closed

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i dunno what program is it running? most programs would finish running but if it was stuck in a loop and had a infinite power source then who knows... :)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0dumb cow, if you dont mind me asking what are your credentials???

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0haha i have 1000 medals

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0The halting problem is about a program that has as input a different program and gives as output whether or not it stops. Apparently it doesn't exist.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0um... do you have a formal educational back groud, dumb cow?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0are you really a student?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0thomas 9, that was an interesting responce

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0but consider the sketch of proof

Owlfred
 5 years ago
Best ResponseYou've already chosen the best response.01234 what type of credentials are you looking for?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0The proof was something with using the initial program as input, but I forgot most of it.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0My OS is supposed to run forever, doesn't though.

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6I have a Ph.D. Galactic Domination(see profile). How's that?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0the proof shows there is no total computable function that decides whether an arbitrary program i halts on arbitrary input x: that is, the function h is not computable

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0galactic domination...!!?? interesting...

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Not algorithmically decidable.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0h(i,x)={1if program i halts on inputx, 0 otherwise

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6yes...I looked at many universities, but Planet Doom University had the program that i really wanted. Great profeessors

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0are you serious Zarkon?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i have not heard from you thomas 9?

myininaya
 5 years ago
Best ResponseYou've already chosen the best response.0galactic domination! i want that degree

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Can I apply for Planet Doom University ?

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6yes...the degree is in high demand

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0estudier what do you think?

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6you can...but the off planet tuition is a killer

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0U have my opinion already.

myininaya
 5 years ago
Best ResponseYou've already chosen the best response.0what kindof question is this, 1234?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0well what about my sketch of proof?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0http://www.google.co.in/search?sourceid=chrome&ie=UTF8&q=Planet+Doom+University

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0the proof he means not the university of doom.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i am going to copy and repost my earlier responce

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0the proof shows there is no total computable function that decides whether an arbitrary program i halts on arbitrary input x: that is, the function h is not computable

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0The proof sketch, not PDUni.

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.01234portion  I didn't see a sketch of a proof. You stated the problem correctly, however.

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6it is not the university of doom...that place it just a diploma mill. Planet Doom University is where I went

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0The proof itself, at least in the original form presented by Alan Turing, involves defining what a computer is and describing how it runs a program (the thennamed Turing machine is the machine that Turing posited for this). I believe you can also prove the same thing using the lambda calculus.

Owlfred
 5 years ago
Best ResponseYou've already chosen the best response.01234 Portion, is this your first day on the site?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0h(i,x)={1if program i halts on inputx, 0 otherwise here program i refers to the i program in an enumeratio of all the programs of a fixed turing complete model of computation.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0that was for you e studier

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0yes to your question owlfred

Owlfred
 5 years ago
Best ResponseYou've already chosen the best response.0okay cool, how did you find us?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0browsing... who are you exactly mr.owl?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0with the utmost respect of course

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0Heh. He's the OpenStudy mascot/moderator in chief.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0and who are you exactly??

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0The Chief Software Engineer at OpenStudy.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0maby you can answer my question?

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0I'm not sure what exactly your question is :) Do you want a full proof for the undecidability of the halting problem?

Owlfred
 5 years ago
Best ResponseYou've already chosen the best response.0Haha, yeah sorry. I'm a moderator on OpenStudy.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0well thank you for your input e studier

myininaya
 5 years ago
Best ResponseYou've already chosen the best response.0i say let the computer program run forever

myininaya
 5 years ago
Best ResponseYou've already chosen the best response.0and let the machines take over

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.610 print "hello" 20 goto 10 what about this

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Q "decide whether" A algorithmically undecidable.

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0The question of the halting problem is for the general case. Given an arbitrary program, decide whether the program will end or not. It is impossible to write a program that will answer this question every time. It *is* possible to write a program that will answer this question sometimes.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0estudier you can try to single out possible values for a total computable function, if you have all the variables and an algorithm in place, cant you???

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0shadow friend that is very intriguing, elaborate!

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0Not sure what you're asking. Can you give an example?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0just explain more in detail about you response shadow friend, and like i said to estudieryou can try to single out possible values for a total computable function, if you have all the variables and an algorithm in place, cant you???

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0A more interesting question is quantifying undecidability, or complexity in general.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i am not sure my computer can even run as long as this thread

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0e studier do you know of any powerful computer programs that postulate very complex and abstract mathematical information?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0and if you dont mind me asking what are your credentials ??? estudier?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0satelllite md phd psyd do dsw dch university of the galaxy (online)

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0how many were bought online

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i got them for free well i did have to buy the candy bars

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0what is up with you satellite73???

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i dont find this funny

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0what ever happened to shadow friend?

Zarkon
 5 years ago
Best ResponseYou've already chosen the best response.6University of the Galaxy ...oooohhh...very prestigious!!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0yeah we used to kick your butts in lacrosse too !

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0girls team did anyway

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0All right, all right, stay on topic. If you want to talk about the University of the Galaxy, go do it in chat.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0was there a topic or just a credential check?

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0Heh. Ignore the credential check ;) The topic at hand is the halting problem.

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0As for my response, I'm just saying that the question of the halting problem is for the general case of any program. You can write a program that recognizes common patterns of programs that halt or don't. You can also decide the halting problem if you're not talking about a general purpose (or Turingcomplete) programming language.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i understand shadowfriend, however i like to know people educational back ground so i know how capable they are in math, but with that been said, why arent satellit73 talking about my problem, he or she i talking about some space university!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0We judge here by deeds not words...

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0come again e studier???

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0where did that come from?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0That is my response to your persistent credential checks, has anyone asked for yours?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0we should not judge period, who are we to do so?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0you said we judge by deeds

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Correct, then the credential checks serve no useful purpose...

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0Credentials are deemphasized on OpenStudy in favor of the community's esteem. Those who want to share them post their school and additional information in their profile.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0keep in mind i am not being disrespectful, i alway say " if you dont mind me asking, what are your credentals" keep in mind i say " if you dont mind" in a case were people do mind they just dont have to answer!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Well, doubtless u noticed that people didn't respond..?

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0I think this particular discussion has run its course.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i can see now, sorry for hurting "the communities esteem"

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0estudier you seem to be just about the most knowledgeable person here

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0no offence intended to anyone

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i thought your answer was pretty good

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0I know a little, so do others, together we know a lot...

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0anyone else want to give it a shot?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Is this just a theory based question? are you trying to disprove, or prove that this type of program works?

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0You may also want to try asking in the computer science group at http://openstudy.com/groups/computer+science . Might get some interesting answers there (though not necessarily as fast as here).

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0thank shadowfriend, and to answer your question z bay, i want to see some ones approach on an algorithm or thought analyses, that is also why i am interested in credentials!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0thanks for you help...i guess?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0if you made a program that tested every x value of a function that goes to infinity you would have a never ending program

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0interesting, how did you conclude that zbay?

shadowfiend
 5 years ago
Best ResponseYou've already chosen the best response.0Unless you developed a computer that could execute infinite operations in finite time, pretty much by definition it wouldn't end.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0the difficulty with the halting problem lies in the requirement that the decision procedure must work for all programs and inputs.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0by the way shadow friend, obviously you are knowledgeable about this website, how can i ask about question having to do with finance, i cant seem to get there through this website!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0whats the finance question?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0not to annoy anyone, but zbay would it be too mucn to ask for credentials pertaining to finance??

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i want to know if you can answer a few accounting questions

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i took accounting 1 and didn't like it but i will see if i can remember any of it

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0cool, and thank you very much by the way, ok here it goes!

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0how can one apply the accounting equation effectively towards a government agency's finances?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i only know how to apply the accounting equation to a business entity

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i like that you tried

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0but i thought there was a finance part to this website, how do i get there?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0you can use a basic credit debit system depending on the sizze of the agency would determine the complexity of your accounting system you would have to have all thing equal and you should be good

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0if you hit the home button at the top you can go to the other groups

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0cool, however unlike a business entity, a gov agency does not receive revenue from a service, so in that case how do you then account for revenue for a gov agency?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0well while a gov agency isn't a money making operation they still get funding by other gov agencys so this funding still needs to be accounted for. this would only change the name of the account it wouldn't change the basic process of the accounting process

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0does that also mean gov agencies can not result in a net loss?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0in theory you can't spend more money than you have but this doesn't apply to the goverment seeing as they can print more. so while i wouldn't call it a net loss we would call it a deficit.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0i think i am well equipped with knowledge from accounting, even thoughits from a business perspective, can i use that same knowledge to effectively do the accounting for a gov agency?

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0Yea you can use the accounting process for the gov but your going to have a few problems. they spend lots of money and employ lots of people so your numbers are goign to be huge and collecting the data needed to account for all the money spent is going to be a pain also.

anonymous
 5 years ago
Best ResponseYou've already chosen the best response.0ok thank you very much for your insight i must leave no bye, and again thanks!
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.