Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re (tilly) 2: Perverse Unreadable Code

by tilly (Archbishop)
on Apr 26, 2001 at 05:48 UTC ( #75691=note: print w/ replies, xml ) Need Help??


in reply to Re: Perverse Unreadable Code
in thread Perverse Unreadable Code

its not just Perl, its any language you can think of, *every* language has the potential for bad code..

More precisely, any Turing complete language.

This is the substance of the first really big theorem about computers, the Halting problem. If the language is general enough to even model something pretty simple, it is possible to give a series of instructions that no amount of analysis can answer even a simple question about.


Comment on Re (tilly) 2: Perverse Unreadable Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (9)
As of 2015-07-28 10:55 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (254 votes), past polls