|From:||"Derek M. Jones" <derek@_NOSPAM_knosof.co.uk>|
|Date:||Mon, 13 May 2019 20:15:02 +0100|
|Injection-Info:||gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="65409"; mail-complaints-to="firstname.lastname@example.org"|
|Posted-Date:||13 May 2019 15:31:03 EDT|
> There are plenty of problems that are known to be undecidable. The
> best known is the halting problem. You cannot write a program that
> can inspect any arbitrary program and always tell you whether the
> program it's inspecting will eventually halt or it will run forever.
This wording of the halting problem tends to lead to all kinds of
I prefer to phrase it as:
It has been provided that there exist programs for which it is not
possible to deduce whether it will eventually halt or not.
For many programs it is possible to deduce whether they will
halt, or not.
Derek M. Jones
Return to the
Search the comp.compilers archives again.