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

Re: perl not omnipotent? let's see!

by rnahi (Curate)
on Oct 12, 2005 at 16:16 UTC ( #499577=note: print w/ replies, xml ) Need Help??

in reply to perl not omnipotent? let's see!

Your claim is pointless. If you are smart and knowledgeable, you may do almost everything in every language.

Somebody even solved The N-queens problem using pure regexes. So Perl could do mostly everything, provided that you know how to. But the real question is "it is really worth doing everything in Perl?

See What is Perl *NOT* good at? for a more reasonable take of this issue.

Comment on Re: perl not omnipotent? let's see!
Replies are listed 'Best First'.
Re^2: perl not omnipotent? let's see!
by Moron (Curate) on Oct 12, 2005 at 16:19 UTC
    It would hardly be either to attempt to write a compiler in say visual basic. I think the N-Queens case is just done for fun - it certainly amused me!


    Free your mind

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (4)
As of 2015-10-09 11:12 GMT
Find Nodes?
    Voting Booth?

    Does Humor Belong in Programming?

    Results (239 votes), past polls