Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Re: Solving Meta Sentences

by Molt (Chaplain)
on May 30, 2002 at 09:58 UTC ( #170335=note: print w/replies, xml ) Need Help??


in reply to Re: Solving Meta Sentences
in thread Solving Meta Sentences

I know this was covered in Hofstadter's book 'Godel, Escher, Bach' (Excellent book, well worth reading), and seem to recall that if you could prove that every sentence would eventually terminate, or prove that a particular sentence would never terminate, then you would have just proven a rather major mathematical theory.

Bonus points for proving it with a Perl script :)

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (5)
As of 2019-11-22 05:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Strict and warnings: which comes first?



    Results (108 votes). Check out past polls.

    Notices?