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

Re: How should Perlmonks deal with Plagiarism?

by johngg (Abbot)
on Oct 08, 2006 at 17:53 UTC ( #577014=note: print w/replies, xml ) Need Help??

in reply to How should Perlmonks deal with Plagiarism?

++ liverpole for bringing this distasteful matter into the open. ++ chargrill for the extra detective work. I find on reading the nodes that I upvoted several of them which is doubly annoying as, having cast my vote already, I can't downvote them as I would have had I known they were ripped off. Thus, IMHO, for every +ve vote two should be taken away.

"Keep pouring your downvotes"



  • Comment on Re: How should Perlmonks deal with Plagiarism?

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://577014]
[LanX]: according to wp: Londoners voted in a referendum in 1998 to create new governance structures for Greater London.
[LanX]: so it was the will of the people to take back control
[LanX]: ;)
[marto]: and you still can't get a decent cup of tea in that town

How do I use this? | Other CB clients
Other Users?
Others chilling in the Monastery: (11)
As of 2017-12-15 19:06 GMT
Find Nodes?
    Voting Booth?
    What programming language do you hate the most?

    Results (442 votes). Check out past polls.