why is halting problem profound?
- From: shimp <example@xxxxxxxxxx>
- Date: Thu, 27 Mar 2008 18:29:14 -0700
Hi. Recently learned of the 'halting problem'. Im no philosopher (but I
know computers). I'm wondering why this theorem is considered to be so
profound and celebrated?? No offense to Turing, a great mind.
My end analysis is that he is basically saying, you cannot determine if
ANY and ALL possible loops of code will ever end, unless you execute the
loop. Whether you actually execute the code, or you unroll it using some
interpreter.. either way you are executing it. It may never end, so you
may never have an answer.
Is this non-obvious to some people? The wording of the theorem is so
abstract and it says nothing about the kind of code or instructions that
the machine is allowed to execute. It could do, or be, anything. No way
you can know until you run it.
Did I miss something? Maybe I interpreted it wrong?
thanks
.
- Follow-Ups:
- Re: why is halting problem profound?
- From: Frederick Williams
- Re: why is halting problem profound?
- From: Douglas Eagleson
- Re: why is halting problem profound?
- From: H. J. Sander Bruggink
- Re: why is halting problem profound?
- From: Marshall
- Re: why is halting problem profound?
- From: Mitch
- Re: why is halting problem profound?
- Prev by Date: Re: Godel proved maths inconsistent not incompleteness theorem
- Next by Date: Re: Godel proved maths inconsistent not incompleteness theorem
- Previous by thread: Blood eating is banned in islam
- Next by thread: Re: why is halting problem profound?
- Index(es):
Relevant Pages
|
|
