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

Re^3: Code posted on PerlMonks

by herveus (Parson)
on May 18, 2010 at 12:29 UTC ( #840498=note: print w/ replies, xml ) Need Help??

in reply to Re^2: Code posted on PerlMonks
in thread Code posted on PerlMonks


Anonymous writings may be protected by copyright, but taking action to enforce that copyright would appear to require dropping the cloak of anonymity. I'm simply noting that if one were to try to exercise due diligence and secure permission from the copyright holder, you can't do that for posts by Anonymous Monk.

If you are being diligent, you would capture the terms attached to the material in question at the same time, so that you could produce evidence that you did operate under the published terms of use in effect at the time. Making a good faith effort to record the relevant information for future reference ought to go far towards mitigating any future nastiness.


Comment on Re^3: Code posted on PerlMonks

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (4)
As of 2015-11-29 19:41 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 (753 votes), past polls