Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^3: OT: Mathematics for programming (again)

by casiano (Pilgrim)
on Sep 17, 2008 at 08:51 UTC ( #711929=note: print w/replies, xml ) Need Help??

in reply to Re^2: OT: Mathematics for programming (again)
in thread OT: Mathematics for programming (again)

The only good way to ensure a program is correct is to run it on a computer.

and viceversa (s/program/proof/g):

The only good way to ensure a proof is correct is to run it on a computer.

If not, what was the reason for all Turing/Godel/Church efforts to fix David Hilbert's problem question on the completeness and consistency of mathematical systems? (Hilbert's program)

That's one of the meanings of Knuth's famous quote

"Beware of bugs in the above code; I have only proved it correct, not tried"

A constructive proof that uses only finite procedures (algorithms) and runs in a Turing-equivalent machine has more value than an ordinary mathematical demonstration.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://711929]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (7)
As of 2018-05-21 16:00 GMT
Find Nodes?
    Voting Booth?