News for hackers. Stuff that matters.
Re:Colornames.org – A collaborative effort to name all 16.7M... by ryangittins on Sunday April 12, 2020 @11:22PM (#22852913)
I don't follow. Two given colors being indistinguishable doesn't imply that any two colors are indistinguishable.
Re:Colornames.org – A collaborative effort to name all 16.7M... by tzs on Monday April 13, 2020 @12:09AM (#22853095)
Your suggestion was that if two colors are indistinguishable, they should have that name.

But given any two colors A and B you can construct a sequence C1 = A, C2, C3, ..., Cn = B where adjacent colors Ci and Ci+1 are indistinguishable from each other, and so need the same name, for 1 <= i < n. Hence, A and B have to have the same name.

Re:Colornames.org – A collaborative effort to name all 16.7M... by ryangittins on Monday April 13, 2020 @12:20AM (#22853147)
The problem with your argument is that indistinguishable doesn't mean the equal. I'm not saying there is no difference between adjacent colors. I'm saying that the difference is indistinguishable. A lot of indistinguishable differences add to a distinguishable difference.

Think about it with numbers: if your sequence A, B, C... are each zero units apart, then yes, A = B = C = ...

In actuality, though, they are not zero units apart. They are a small, but positive distance apart. Those tiny differences add up so the distance from A to C is twice as far as the distance from A to B.

Re:Colornames.org – A collaborative effort to name all 16.7M... by tzs on Monday April 13, 2020 @12:06PM (#22857025)
Let's do an example, using just colors with no red or green in their RGB representation so we just have to give the B component, which is a decimal from from 0 to 255. Let's call 0 "black".

Your suggestion was that if a color is close enough to another to be indistinguishable it the two should have the same name.

1 is close enough to 0, so gets the name "black" too.

How about 2? That's farther from 0 "black". Is it distinguishable? If not, it too is "black", and we can go on to compare 3 and 0, and beyond.

At some point we get our lowest blue-only RGB color that is distinguishable from 0 "black". Suppose that is 4. So we have 0, 1, 2, and 3 are all called "black", and since 4 is distinguishable from 0 it needs a new name, say "very light blue".

But now we have 3 "black" only 1 away from 4 "very light blue". Those are probably indistinguishable, so are supposed to have the same name. Oops.

Re:Colornames.org – A collaborative effort to name all 16.7M... by baddox on Monday April 13, 2020 @01:15AM (#22853370)
Any two adjacent colors must either have the same name or different names.
Re:Colornames.org – A collaborative effort to name all 16.7M... by Filligree on Monday April 13, 2020 @02:20AM (#22853596)
This assumes a color must have only one name. Why not two, or more?
Re:Colornames.org – A collaborative effort to name all 16.7M... by baddox on Monday April 13, 2020 @02:31AM (#22853635)
Having more than one name doesn’t change the story, and neither does some colors having no name at all. For each pair of adjacent colors which is indistinguishable to most people, and the two colors must either have the same name (the two sets of names are equal) or different names (the two sets of names have no intersection).
Re:Colornames.org – A collaborative effort to name all 16.7M... by eru on Monday April 13, 2020 @12:10AM (#22853101)
It's just the old paradox of the heap. https://en.wikipedia.org/wiki/Sorites_paradox
Re:Colornames.org – A collaborative effort to name all 16.7M... by IgorPartola on Monday April 13, 2020 @12:18AM (#22853138)
So make Ci and Ci + 1 distinguishable. Problem solved.