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

Re^2: MOPT-03 - identification, part 1

by adrianh (Chancellor)
on Dec 29, 2002 at 10:10 UTC ( #222900=note: print w/ replies, xml ) Need Help??

in reply to Re: MOPT-03 - identification, part 1
in thread MOPT-03 - identification, part 1

'm just wondering - does this belong on a Perl site? Is Perlmonks turning into long-summaries-of-basic-programming-theory monks?

If it were just talking about programming theory in the abstract I might agree, but perl was used to illustrate specific examples - so I say it belongs here.

The theory may not interest you, but it does interest me (and judging by the node rep quite a few others too). I'm finding it an interesting refresher on stuff I learned many years ago when I was at university - and doing it in the context of perl is an interesting twist.

Comment on Re^2: MOPT-03 - identification, part 1

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (9)
As of 2015-11-26 12:07 GMT
Find Nodes?
    Voting Booth?

    What would be the most significant thing to happen if a rope (or wire) tied the Earth and the Moon together?

    Results (697 votes), past polls