[tpm] Complexity and language

[Fulko Hew]

On Thu, Jun 7, 2012 at 3:47 PM, <arocker at vex.net> wrote:

... snip ...


> TPM are probably bored with me talking about destructive testing, but at
> the risk of repeating myself; the company that taught me to program had a
> design standard that started every system with a data validation program,
> to check every field in the input for reasonable values.
>
> Before these programs were put into production,there was a final ordeal
> they had to survive; reading their own object code, input backwards. To
> pass, they had to output a reasonable set of error messages, and terminate
> normally, even though what they'd just swallowed was about as unreasonable
> as it was possible to get.
>

That's just one possible error mode, what about all the other permutations?

But seriously, I'm talking about more than 'field validation' but
algorithmic
equivalence (or non-equivalence... where a+b != b+a)
[Or would that be 'temporal significance'?]
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.pm.org/pipermail/toronto-pm/attachments/20120607/4afad74a/attachment.html>