Re: bart again (UCX64)

From	Kaz Kylheku <864-117-4973@kylheku.com>
Newsgroups	comp.lang.c
Subject	Re: bart again (UCX64)
Date	2023-09-09 05:22 +0000
Organization	A noiseless patient Spider
Message-ID	<20230908222015.25@kylheku.com> (permalink)
References	(24 earlier) <r1JIM.297958$uLJb.27694@fx41.iad> <ucvuhq$gmlg$1@dont-email.me> <ud60pq$1mf0p$1@dont-email.me> <20230904234329.835@kylheku.com> <udgv0h$3ufb5$1@dont-email.me>

Show all headers | View raw

On 2023-09-09, James Kuyper <jameskuyper@alumni.caltech.edu> wrote:
> On 9/5/23 02:49, Kaz Kylheku wrote:
>> On 2023-09-05, vallor <vallor@cultnix.org> wrote:
> ...
>>> Isn't asking a C compiler to watch for interminable loops and
>>> such things akin to trying to solve the halting problem?
>>
>> The Halting Problem is academic. The main reasons why you can't
>> accurately determine reachability in C programs are practical:
>
> If the C standard mandated diagnosing unreachable code, that would
> require solving the Halting Problem, which is impossible.

If the C standard mandated diagnosing unreachable code, it would
require a crystal ball, which makes Turing-related difficulties
moot ... being the point.

Therefore, nobody in their right mind will do that; they will focus on
that which can be done in a way that is practical and useful, reasonably
easy to understand (and thus predict) and of the most benefit and least
nuisance.

-- 
TXR Programming Language: http://nongnu.org/txr
Cygnal: Cygwin Native Application Library: http://kylheku.com/cygnal
Mastodon: @Kazinator@mstdn.ca
NOTE: If you use Google Groups, I don't see you, unless you're whitelisted.

Back to comp.lang.c | Previous | Next — Previous in thread | Find similar

Thread

Re: bart again (UCX64) James Kuyper <jameskuyper@alumni.caltech.edu> - 2023-09-09 01:14 -0400
  Re: bart again (UCX64) Kaz Kylheku <864-117-4973@kylheku.com> - 2023-09-09 05:22 +0000

csiph-web