Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^3: RFC: Hide Very Bad Answers From Visitors

by shmem (Chancellor)
on Jul 25, 2018 at 22:01 UTC ( [id://1219287]=note: print w/replies, xml ) Need Help??


in reply to Re^2: RFC: Hide Very Bad Answers From Visitors
in thread RFC: Hide Very Bad Answers From Visitors

No it really doesn't. Anyone, even Anonymous Monk, may post whatever they like. Their post will be accepted and will be displayed to any logged-in user. What it goes against is broadcasting seriously dubious content which is precisely how things should be.

Careful. There is no broadcasting involved here. Any information which leaves this site is polled, not pushed - it is up to the recipients which parts they retrieve. The analogy to Radio and TV is flawed. This site is more like a public library with private and public gathering zones attached... well, more like a Monastery ;-)

What use is a Speaker's Corner if, at the arrival of the senventh disagreeing with me, I am (or my words which count at that) are removed from said corner and can't be heard anymore, except for a handful of insiders connected to me anyways?

For plain off-topic things, ad-hominem attacks and such we already have the consideration process.

a similar manner, if anyone wants to read such poor content on PerlMonks they merely need to login.

As I tried to explain, even poor content is educational in its own way. And then, there are many ways in which some content might be considered to be poor, reflected somehow in the vote tally, which is by any means collectively subjective. Establishing a number of negative reputation as a measure of quality isn't something I can agree upon.

Then, there might be a significant amount of Anonymous Monks which just don't want to sign in anymore based on past experiences. Abigail-II comes to mind. And they might provide valuable information to nodes voted negative on purely technical merits (which should always be the case in some sense of purity), and providing this valuable information on a technical basis.

perl -le'print map{pack c,($-++?1:13)+ord}split//,ESEL'
  • Comment on Re^3: RFC: Hide Very Bad Answers From Visitors

Replies are listed 'Best First'.
Re^4: RFC: Hide Very Bad Answers From Visitors
by hippo (Bishop) on Jul 26, 2018 at 08:19 UTC
    There is no broadcasting involved here. Any information which leaves this site is polled, not pushed - it is up to the recipients which parts they retrieve. The analogy to Radio and TV is flawed.

    The analogy isn't perfect, I grant you. But it isn't as flawed as all that. It is equally up to the audience of radio and TV which parts they receive - it's a decision to tune to a particular frequency or visit a particular website. Whether the content is pushed or pulled at that point is a technical distinction. The content is there to be absorbed by anyone and therefore a similar sort of quality control is advisable. Again, IMHO.

    As I tried to explain, even poor content is educational in its own way.

    I don't disagree (although I think "can be" rather than "is" might be truer). But for those Anonymous browsers who might be new to Perl or even to programming in general, how might they tell the good content from the poor? They might see a post and think, "Yes, I'll do it that way" even though to an experienced user the content might be obviously wrong or even dangerous. In the absence of any of the other methods previously discussed to protect the neophytes the proposed (and current) system will do the job. It might not be the best but it is at least better than what we had previously.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2024-04-23 15:48 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found