Re: [Lit.] Buffer overruns
From: Trevor L. Jackson, III (tlj3_at_comcast.net)
Date: 01/31/05
- Next message: Phil Carmody: "Re: [Lit.] Buffer overruns"
- Previous message: Tom Linden: "Re: [Lit.] Buffer overruns"
- In reply to: Xcott Craver: "Re: [Lit.] Buffer overruns"
- Next in thread: Tom Linden: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Mon, 31 Jan 2005 09:01:12 -0500
Xcott Craver wrote:
> Trevor L. Jackson, III <tlj3@comcast.net> wrote:
>
>>nemo outis wrote:
>>
>>
>>>There is no rational number that is the square root of 2.
>>>
>>>There is a classic proof for the non-existence of that entity.
>>
>>OK, prove to us with similar rigor that you no longer beat your
>>significant other.
>>
>>Math is the domain of toy proofs. Bring them into the real world and
>>they are useless.
>
>
> But, proving the type-safety of a computer program is a
> matter of mathematical proof.
Not really. Much of the input is opinion from the people involved
rather than known-true or -false premises. That fuzziness turns boolean
expressions into probabilistic ones.
- Next message: Phil Carmody: "Re: [Lit.] Buffer overruns"
- Previous message: Tom Linden: "Re: [Lit.] Buffer overruns"
- In reply to: Xcott Craver: "Re: [Lit.] Buffer overruns"
- Next in thread: Tom Linden: "Re: [Lit.] Buffer overruns"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Relevant Pages
|
|
