Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Smallest possible universal Turing Machine found (with Perl's help)

by sir_lichtkind (Friar)
on Oct 30, 2007 at 12:41 UTC ( #648007=note: print w/ replies, xml ) Need Help??

Comment on Re: Smallest possible universal Turing Machine found (with Perl's help)
Re^2: Smallest possible universal Turing Machine found (with Perl's help)
by BrowserUk (Pope) on Oct 30, 2007 at 19:07 UTC

    Kinda supports my long held belief that the idea that mathematical proofs can be used as a substitute for, or as a way to reduce the need for, the conventional testing and analysis of computer programs, is pretty much foundationless.

    The problem with mathemeatical proofs is that not only do experts make mistakes when writing them, but other experts make mistakes when verifying them. And there are no methods available for proving proofs, beyond expert review.

    Which somewhat makes a mockery of the idea that you can achieve "provably correct programs" by compiling them directly from mathematical proof notations.


    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.
Re^2: Smallest possible universal Turing Machine found (with Perl's help)
by Argel (Prior) on Nov 17, 2007 at 00:12 UTC

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://648007]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (4)
As of 2014-09-24 03:05 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (244 votes), past polls