Question

the Haulting question: say there was a computer program, decide whether the program finishes running or runs forever!?!?!

Answer 1

i 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... :)

Answer 2

dumb cow, if you dont mind me asking what are your credentials???

Answer 3

haha i have 1000 medals

Answer 4

haha

Answer 5

The 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.

Answer 6

um... do you have a formal educational back groud, dumb cow?

Answer 7

are you really a student?

Answer 8

thomas 9, that was an interesting responce

Answer 9

but consider the sketch of proof

Answer 10

1234 what type of credentials are you looking for?

Answer 11

The proof was something with using the initial program as input, but I forgot most of it.

Answer 12

My OS is supposed to run forever, doesn't though.

Answer 13

lol

Answer 14

I have a Ph.D. Galactic Domination(see profile). How's that?

Answer 15

the 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

Answer 16

galactic domination...!!??
interesting...

Answer 17

thomas 9

Answer 18

Not algorithmically decidable.

Answer 19

yes?

Answer 20

h(i,x)={1if program i halts on inputx, 0 otherwise

Answer 21

Not recursive.

Answer 22

yes...I looked at many universities, but Planet Doom University had the program that i really wanted. Great profeessors

Answer 23

are you serious Zarkon?

Answer 24

i have not heard from you thomas 9?

Answer 25

galactic domination!
i want that degree

Answer 26

sounds hot and spicy

Answer 27

Can I apply for Planet Doom University ?

Answer 28

yes...the degree is in high demand

Answer 29

estudier what do you think?

Answer 30

you can...but the off planet tuition is a killer

Answer 31

U have my opinion already.

Answer 32

what kindof question is this, 1234?

Answer 33

well what about my sketch of proof?

Answer 34

http://www.google.co.in/search?sourceid=chrome&ie=UTF-8&q=Planet+Doom+University

Answer 35

Where is it?

Answer 36

the proof he means not the university of doom.

Answer 37

i am going to copy and repost my earlier responce

Answer 38

the 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

Answer 39

The proof sketch, not PDUni.

Answer 40

1234portion -- I didn't see a sketch of a proof. You stated the problem correctly, however.

Answer 41

it is not the university of doom...that place it just a diploma mill. Planet Doom University is where I went

Answer 42

The 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 then-named Turing machine is the machine that Turing posited for this). I believe you can also prove the same thing using the lambda calculus.

Answer 43

1234 Portion, is this your first day on the site?

Answer 44

h(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.

Answer 45

that was for you e studier

Answer 46

yes to your question owlfred

Answer 47

okay cool, how did you find us?

Answer 48

browsing... who are you exactly mr.owl?

Answer 49

with the utmost respect of course

Answer 50

...

Answer 51

Heh. He's the OpenStudy mascot/moderator in chief.

Answer 52

and who are you exactly??

Answer 53

The Chief Software Engineer at OpenStudy.

Answer 54

cool

Answer 55

maby you can answer my question?

Answer 56

Asked and answered.

Answer 57

I'm not sure what exactly your question is :) Do you want a full proof for the undecidability of the halting problem?

Answer 58

Haha, yeah sorry. I'm a moderator on OpenStudy.

Answer 59

well thank you for your input e studier

Answer 60

i say let the computer program run forever

Answer 61

lol

Answer 62

lol @ myin

Answer 63

and let the machines take over

Answer 64

10 print "hello"
20 goto 10

what about this

Answer 65

Q "decide whether" A algorithmically undecidable.

Answer 66

The 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.

Answer 67

estudier 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???

Answer 68

shadow friend that is very intriguing, elaborate!

Answer 69

Not sure what you're asking. Can you give an example?

Answer 70

just 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???

Answer 71

A more interesting question is quantifying undecidability, or complexity in general.

Answer 72

i am not sure my computer can even run as long as this thread

Answer 73

e studier do you know of any powerful computer programs that postulate very complex and abstract mathematical information?

Answer 74

and if you dont mind me asking what are your credentials ??? estudier?

Answer 75

satelllite
md
phd
psyd
do
dsw
dch
university of the galaxy
(online)

Answer 76

how many were bought online

Answer 77

i got them for free
well i did have to buy the candy bars

Answer 78

what is up with you satellite73???

Answer 79

lol

Answer 80

i dont find this funny

Answer 81

what ever happened to shadow friend?

Answer 82

University of the Galaxy ...oooohhh...very prestigious!!

Answer 83

yeah we used to kick your butts in lacrosse too !

Answer 84

yeah...we suck. :(

Answer 85

girls team did anyway

Answer 86

All right, all right, stay on topic. If you want to talk about the University of the Galaxy, go do it in chat.

Answer 87

was there a topic or just a credential check?

Answer 88

Heh. Ignore the credential check ;) The topic at hand is the halting problem.

Answer 89

As 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 Turing-complete) programming language.

Answer 90

i 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!

Answer 91

it makes no sense !

Answer 92

We judge here by deeds not words...

Answer 93

come again e studier???

Answer 94

where did that come from?

Answer 95

That is my response to your persistent credential checks, has anyone asked for yours?

Answer 96

we should not judge period, who are we to do so?

Answer 97

you said we judge by deeds

Answer 98

Correct, then the credential checks serve no useful purpose...