A possible solution to the halting problem...

(1) \"Yes, the program under consideration will halt when fed the input in question.\"
(2) \"No, the program under consideration will not halt when fed the input in question.\"
(3) \"I refuse to try to answer that question, because the program under consideration
looks too much like me.\"

Answer 3 would be considered a cop-out. You can perhaps keep the
analyzer from getting stuck in a contradiction, but this means that it
cannot give correct answers to all sets of input.

No you\'re wrong.

Step 1. Split the program in detecting H and H+.

Analyze H and H+ seperately.

Alan lived during a time of war, any war arguments are valid, to counter his war arguments.

I wasn\'t looking for your post, but the logic equivalence post of somebody else.

Again also take time and order into account.

My first capture H, if H can prevent capture because of self-awareness, H+ cannot even be build.

Second argument against halting problem.

Bye,
Skybuck.
 
Let\'s put this argument to rest once and for all:

1. Skybuck builds Machine H.
2. Alan captures Machine H.
3. Alan builds Machine H+ around machine H.
4. Alan feeds Machine H+ into itself.
5. Skybuck\'s Machine H detects Machine H inside Machine H+.
6. Skybuck\'s Machine H detects parasite code of Machine H+.
7. Skybuck\'s Machine H isolates parasite code of Machine H+.
8. Skybuck\'s Machine H analyzes parasite code of Machine H+.
9. Skybuck\'s Machine H outputs result for parasite code.

Bye,
Skybuck.
 
skybuck2000 <skybuck2000@hotmail.com> wrote in
news:97f3103c-52d6-470c-af53-1cfcb939d498n@googlegroups.com:


Bye,
Skybuck.

Halting problem...

Go AWAY, wussy boy.

As in HALT posting here.

Damn you are stupid SkyPunk0

Go masturbate elsewhere, putz.
 

Welcome to EDABoard.com

Sponsor

Back
Top