On Thursday 12 January 2006 12:13, Daniel Berlin wrote:
> > The chain of inferences that the compiler would need to do to properly
> > diagnose this case is beyond the scope of the mechanical
> > transformations. The reasoning you need to implement to catch these
> > cases could even be reduced to the halting problem.
>
> I hate to bring this up, because it's a "half-troll", but the halting
> problem is *not* undecidable on the machines we use everyday, because
> they have finite memory.
>
I didn't say it was undecidable. I only brought it up to mean "pretty
hard".
