Tail pad optimization, cache friendlyness and C++ interrop

[via Digitalmars-d]

On Thursday, 19 June 2014 at 18:50:27 UTC, H. S. Teoh via 
Digitalmars-d wrote:
> Exactly.  Just because something is *finite*, doesn't 
> necessarily mean
> it's practical.  Anything that requires enumeration of all 
> possible
> states is impractical, because it has an exponential worst case 
> bound,
> which is unacceptable for compilation time (or for anything, 
> really,
> except in the most trivial cases).

You are being silly. You either discuss computability or you 
discuss complexity. Please don't mix the two topics.

You either discuss a useful verification of safe features or you 
don't.

It's not at all impossible to verify memory safety for real time 
applications. Real time applications have an upper bound on how 
long they should run. This even holds for TMs.

The problem "does the TM terminate within N steps" is decidable.