Talk:Power set

So how about the slow approach of coming up with random combinations and adding them to a set until it has 2ⁿ elements? The set object would have to guarantee uniqueness, but it would work eventually. To save some time you could add each element in the original list and the empty set to start then add sets of size 2 to n. --Mwn3d 10:59, 16 June 2008 (MDT)

This is what your Ada code gives:

• A
• C
• E
• A
• A,C
• A,E
• A,C

This is fixed. --Dmitry-kazakov 18:22, 14 October 2008 (UTC)

Another copyleft issue?

About Smalltalk code... as written, is taken from a (odd?) blog hosted on the GNU Smalltalk site... so I suppose the content conforms to free doc license or GPL... check the link. I really believe there's no problem in publishing on RC; I will try to contact the author. If any problem, I'll remove it. --ShinTakezou 22:56, 1 April 2009 (UTC)

Not copyleft, copyright. No license is specified on the site, so it's implicitly All Rights Reserved. Go ahead and contact the author, but I think we may be developing a problem of copy/paste submissions without proper thought given to source license prior to submission. I'm not sure what to do about it; the phrase "DO NOT SUBMIT COPYRIGHTED WORK WITHOUT PERMISSION" is sitting right there art the bottom of this edit form. Maybe I can move it somewhere more visible, or use Javascript to pop up a warning dialog to anon users, and to logged-in users once (dependent on a cookie). Annoying, yes. But there's no way I can afford any kind of legal defense. --Short Circuit 01:17, 2 April 2009 (UTC)