Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Perl Cannot Be Parsed: A Formal Proof

by pajout (Curate)
on Jan 21, 2008 at 19:11 UTC ( #663419=note: print w/ replies, xml ) Need Help??


in reply to Perl Cannot Be Parsed: A Formal Proof

If I catched all correctly, halts() returns true _after_ ran Turing machine $machine halts. And, consequently, halts() runs till $machine runs...


Comment on Re: Perl Cannot Be Parsed: A Formal Proof

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (6)
As of 2014-07-31 07:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite superfluous repetitious redundant duplicative phrase is:









    Results (245 votes), past polls