581:. First, I realize this is talking about images and not audio clips, but there doesn't seem to be the same level of policy/guideline detail set out for audio, maybe because it tends to serve a different purpose in articles. But this case isn't about adding a clip of a song to an article about a song, or something like that, so I think the point that the above quote is making is still worth applying. On a side note, without bothering to import this thing and actually look at the waveform, I can't be sure, but there should be periods of sound of equal length with those of silence, and to me, the tones sound longer than the silences. I could be wrong, but there's zero documentation for the utility you pointed to, and that's kind of a problem if it can't be verified. Anyway, that's all kind of beside the point, because even if it were correct, I can't see that it's useful to include. –
381:"It especially applies in games where the players move along a path to reach a desired goal, eliminating any advantage potentially gained by either player by taking the first turn." - Provided that advantages are equally distributed throughout the game, and that the path is infinite... In most games, none of these premises apply, but certainly, in many games these can be taken as approximations. Then the Thue-Morse sequence may balance out most of the advantage. And even when the premises do not apply, the sequence may reduce the unfairness. Consider the situation in which the children are to divide into teams for an informal soccer match. First, the two top players are appointed for choosing. Then they choose one player at at time, following the Thue-Morse sequence. This will balance out part of the advantage of choosing first. Elias Hasle
356:, if the best properties in the game were the light-blue properties—they aren't—which are available within a single move of the starting point, the first player would have the opportunity to land on such a property and claim it, whereas the second player would have a reduced chance to claim a light-blue property because one of the properties on which he might land has already been claimed). Nonetheless, the described reasoning is much the same as I employed when I discovered Thue-Morse at a very young age. It's worth noting that the first term of Thue-Morse must be discarded when you are attempting to use it to "balance" in this manner.
159:
149:
128:
641:. The periods representing an isolated "1" are as long as the periods representing an isolated "0, the periods representing "11" and "00" are twice as long, accordingly. Perhaps the speed is too fast to pick this up clearly, i made a slower version. I think you are the first person who expressed this preference for capitalization to me. For me it is visual noise, but i try to remember your preference and hope i do it decently. --
80:
21:
97:
281:'Also, the sequence was rediscovered in 2000 by 8th grade student John Colosimo, who used it as the perfect order in which participants in turn-taking games could most fairly take turns. It especially applies in games where the players move along a path to reach a desired goal, eliminating any advantage potentially gained by either player by taking the first turn.'
713:
443:
BTW: "Since Thue published in German, his work was ignored at first" is nonsense, Einstein also published in German. At that time, you could not just ignore
Hilbert's publications because they were in German, or Poincaré's because they were French. (Actually, there is still quite a lot of mathematics
346:
is indeed balanced, though one must concede that most games consist of finite turns, and of those, most are predisposed to granting an unfair advantage to one side or the other, even when attempting to offset that advantage with Thue-Morse, due to the fact that the number of turns tends to most often
377:
I believe this sequence is well known to very many people having the slightest degree of
Obsessive Compulsive Disorder. That is because it seems like the most "fair" sequence of things. For a person with OCD, it is often important that if he first turns his head to the right, then he must also turn
402:
I think my addition addresses several of the points made above. It basically provides the mathematical underpinning for the observations of "8th grade student John
Colosimo." And it dates to my own OCD behavior governing the order in which I stepped over sidewalk cracks starting around age 9 (in
458:
This article contains the worst explanation of a sequence I have ever seen. The beginning of the article shows the first few terms of the sequence with spaces in between some of the bits, making it seem like the first element is 0, the next is 10, etc. when in fact each element of the sequence is
557:
i added this audio to the article which was removed with the comment "can't see that as being very useful, and it's somewhat unclear how the sequence was being converted to sound anyway". as for the usefulness, i personally wondered what it sounded like and i think it has some musical potential
284:
An interesting application for the Thue-Morse
Sequence. Congratulations. However, I searched the web for an evidence of this statement without finding one. There are may other examples of people who 'happened' to re-discovered the Thue-Morse Sequence, so I suggest either to give an evidence
240:
Here is my implementation in Python, which uses the "When counting in binary, the digit sum modulo 2 is the Thue–Morse sequence" fact. itertools.count() just counts 0, 1, 2, 3... forever (this could also be written as a while loop to make it into pseudocode). bit_count() calculates the
1102:
program itself, but addressing the reverse vs. forward list of bits: there's something called the parity number, which is a decimal point ("bit point"??) in front of the Thue–Morse sequence of bits, with sequence bits appearing left to right. So, a forward result returned by
378:
it to the left. But because having the head turned first is more valuable than last, he must then turn the head to the left again. Then to the right, since the number must be equal. And then the generalization is easy to find.
602:
Off-topic, but if you want to discuss here, please please have the common courtesy to use capitalization. This isn't just an informal chat room or something, and it does make reading a lot easier. Thanks,
579:"The purpose of an image is to increase readers' understanding of the article's subject matter, usually by directly depicting people, things, activities, and concepts described in the article. ..."
254:
459:
just one bit. I have no clue why someone thought this would make the definition comprehensible. I had to read the article several times to figure out what was meant. I demand this be rewritten.
344:
801:
215:
1054:, but without a good source we haven't verified that it is noteworthy, so we get to the same answer if we don't have consensus: don't do it. Let's see if I can find some worthy source. —
347:
fall in a fairly narrow band (which can be trivially proven by observing that in a game which typically finishes in a single turn, the first player will have a significant advantage!).
352:
Even in situations where the number of turns is distributed in such a way that it offsets this advantage, many games still give undue benefit to the first player (for example, in
794:
Prouhet was the first to study it. Shouldn't this page name rely on the full 3 names, i.e., Prouhet–Thue–Morse, as it is already the case in France ? ( cf fr.wikipedia )
694:
558:(though, maybe in a less raw form..). as for the second point: 0 is represented by silence, 1 by a square wave. the commons-description shows the method i used. --
521:
It would be a very good idea if these were disambiguated by being very clear in the article just which one of these is being referred to in any given statement.
625:
1107:
divided by an appropriate power of 2 is a rational approximation of that parity number. That's a small argument in favor of returning the forward pattern. —
1300:
205:
515:
b) the successive overlaying of each of those finite strings on the first half of the next, to make one (semi-)infinite string 0110100110010110 . . .
251:
import itertools def thue_morse(): for n in itertools.count(): yield n.bit_count() & 1 for b in thue_morse(): print(b, end=", ")
1290:
72:
820:
article might have original research, and I am actually concerned that the writing might be contrived to direct credit to particular researchers.
548:
181:
626:
1295:
779:
612:
590:
466:
388:
549:
258:
805:
172:
133:
1263:
1121:
1068:
1018:
419:
1081:, already used for the other code. If a bit-hacking trick isn't in that source, it probably doesn't have a published source. —
700:
624:
237:
To me, the pseudocode was not very clear, especially considering indexOfHighestOneBit was neither implemented nor explained.
825:
1028:
We should have at most one implementation and I lean towards having zero, especially as without sources it appears to be
428:
108:
547:
1138:, until we find some sort of source, but I have it down to four simple operations per iteration for the forward order.
732:
485:. However, since using spaces to divide up the sequence into blocks seems to have confused you, I have removed them.
304:
574:
1086:
1037:
821:
524:
The article with its current confusion is very sloppy and hence inappropriate for an encyclopedia article.
470:
775:
608:
586:
392:
751:
has info on extensions to sharing fairly between more than two and Python code. Is it worth including? --
445:
292:
285:(publication) that John Colosimo indeed re-discovered the Thue-Morse Sequence, or to delete the section.
637:
I think it gives an impression about what an aperiodic yet highly regular sequence "feels" like, it's a
435:
353:
114:
61:
36:
748:
158:
797:
720:
646:
563:
462:
407:
384:
411:
96:
1259:
1117:
1082:
1064:
1033:
1014:
756:
490:
415:
48:
180:
on
Knowledge. If you would like to participate, please visit the project page, where you can join
771:
604:
582:
164:
148:
127:
20:
1032:. I think the other order is more natural so I would prefer not to replace it with this one. —
364:
666:
728:
642:
559:
710:
A map of how frequently a point is visited is given here (larger dot = greater frequency)
1267:
1125:
1090:
1072:
1041:
1022:
829:
809:
783:
760:
736:
650:
616:
594:
567:
536:
509:
The article uses the term "Thue-Morse sequence" to mean at least three distinct things:
494:
474:
448:
438:
396:
371:
295:
262:
1250:
1135:
1108:
1055:
1047:
1005:
752:
532:
486:
242:
696:: turn right 90°. Then go forward. Can anyone prove that the instructions I gave draw
1284:
57:
53:
1131:
1051:
1029:
767:
638:
358:
1095:
Thank you, Arndt is a great addition to my knowledge base. I'll look through it.
512:
a) the sequence of finite strings 0, 01, 0110, 01101001, 0110100110010110, . . .
481:
The clue is in the words "binary sequence" in the first sentence, which links to
177:
766:
That isn't an article so much as a blog post, and so it seems to fail to be a
724:
553:
acoustic representation of the Thue-Morse sequence as a series of square waves
154:
712:
528:
482:
31:
275:(That's my 1st wikipedia entry so - my apologies if something is wrong...)
859:"""Return a string of the first 2**n bits of the Thue-Morse sequence."""
1159:"""Return an int of the first 2**n bits of the Thue-Morse sequence."""
839:
We can construct the sequence in forward rather than reverse order.
699:
711:
698:
622:
545:
65:
40:
column on 28 February 2004. The text of the entry was as follows:
90:
15:
78:
527:
I hope someone more knowledgeable than I will fix this.
669:
307:
996:
Should we do that? This makes use of the fact that
575:
Knowledge:Image use policy#Adding images to articles
403:1959). Robert Richman 01:36, 16 January 2012 (UTC)
278:In the 'History' section, user 'colosimo' states:
176:, a collaborative effort to improve the coverage of
688:
518:c) the sequence of binary digits occurring in b).
338:
339:{\displaystyle \lim _{n\rightarrow \infty }a(n)}
309:
245:, and & 1 is like taking "modulo 2"/parity.
8:
795:
718:
122:
674:
668:
312:
306:
73:Knowledge:Recent additions/2004/February
1077:First source I would search is Arndt's
255:2605:A601:A621:3500:9C07:ED35:CE4A:8532
124:
94:
1002:(1 << (1 << i)) - 1 - bits
578:
71:A record of the entry may be seen at
7:
802:2A01:E0A:225:9A60:80A3:4C2D:8276:F28
790:renaming the page Prouhet–Thue–Morse
170:This article is within the scope of
268:(History section and John Colosimo)
113:It is of interest to the following
319:
14:
1301:Low-priority mathematics articles
190:Knowledge:WikiProject Mathematics
79:
193:Template:WikiProject Mathematics
157:
147:
126:
95:
19:
1291:Knowledge Did you know articles
233:Unclear code, my implementation
210:This article has been rated as
1268:17:29, 26 September 2024 (UTC)
1126:21:41, 25 September 2024 (UTC)
1091:19:56, 25 September 2024 (UTC)
1073:18:13, 25 September 2024 (UTC)
1042:18:05, 25 September 2024 (UTC)
1023:17:46, 25 September 2024 (UTC)
784:12:28, 11 September 2019 (UTC)
761:12:07, 11 September 2019 (UTC)
333:
327:
316:
1:
444:being published in French.)--
429:Image:Morse-Thue sequence.gif
372:18:56, 28 November 2007 (UTC)
296:16:23, 20 December 2006 (UTC)
184:and see a list of open tasks.
1296:C-Class mathematics articles
1098:Although not justifying our
810:12:00, 21 January 2022 (UTC)
397:09:47, 19 October 2009 (UTC)
1130:Okay, I admit that this is
737:21:04, 14 August 2019 (UTC)
1317:
830:21:46, 27 April 2022 (UTC)
659:Thue-Morse sequence curves
263:04:50, 3 August 2023 (UTC)
1000:can be complemented with
651:23:43, 8 April 2019 (UTC)
617:22:11, 8 April 2019 (UTC)
595:22:04, 8 April 2019 (UTC)
568:21:22, 8 April 2019 (UTC)
495:08:18, 5 April 2012 (UTC)
475:04:36, 5 April 2012 (UTC)
209:
142:
121:
1141:
841:
537:08:23, 7 July 2014 (UTC)
449:09:09, 9 July 2007 (UTC)
439:22:06, 8 July 2007 (UTC)
216:project's priority scale
30:appeared on Knowledge's
689:{\displaystyle T_{k}=1}
542:acoustic representation
173:WikiProject Mathematics
835:thue_morse_bits() code
716:
703:
690:
631:
554:
340:
103:This article is rated
84:
1079:Matters Computational
715:
702:
691:
629:
552:
341:
82:
62:differential geometry
744:More than two? Code?
667:
305:
196:mathematics articles
52:has applications in
49:Thue-Morse sequence
28:Thue–Morse sequence
816:Original research?
717:
704:
686:
632:
555:
501:Article conflates
336:
323:
165:Mathematics portal
109:content assessment
85:
1046:I think of it as
812:
800:comment added by
739:
723:comment added by
627:
619:
550:
465:comment added by
424:
410:comment added by
387:comment added by
308:
288:Best regards
230:
229:
226:
225:
222:
221:
89:
88:
1308:
1255:
1244:
1241:
1238:
1235:
1232:
1229:
1226:
1223:
1220:
1217:
1214:
1211:
1208:
1205:
1202:
1199:
1196:
1193:
1190:
1187:
1184:
1181:
1178:
1175:
1172:
1169:
1166:
1163:
1160:
1157:
1154:
1151:
1148:
1145:
1113:
1106:
1101:
1060:
1010:
1003:
999:
992:
989:
986:
983:
980:
977:
974:
971:
968:
965:
962:
959:
956:
953:
950:
947:
944:
941:
938:
935:
932:
929:
926:
923:
920:
917:
914:
911:
908:
905:
902:
899:
896:
893:
890:
887:
884:
881:
878:
875:
872:
869:
866:
863:
860:
857:
854:
851:
848:
845:
695:
693:
692:
687:
679:
678:
628:
601:
551:
477:
423:
404:
399:
369:
367:
361:
345:
343:
342:
337:
322:
198:
197:
194:
191:
188:
167:
162:
161:
151:
144:
143:
138:
130:
123:
106:
100:
99:
91:
81:
23:
16:
1316:
1315:
1311:
1310:
1309:
1307:
1306:
1305:
1281:
1280:
1251:
1246:
1245:
1242:
1239:
1236:
1233:
1230:
1227:
1224:
1221:
1218:
1215:
1212:
1209:
1206:
1203:
1200:
1197:
1194:
1191:
1188:
1185:
1182:
1179:
1176:
1173:
1170:
1167:
1164:
1161:
1158:
1155:
1152:
1149:
1147:thue_morse_bits
1146:
1143:
1109:
1105:thue_morse_bits
1104:
1100:thue_morse_bits
1099:
1056:
1006:
1001:
997:
994:
993:
990:
987:
984:
981:
978:
975:
972:
969:
966:
963:
960:
957:
954:
951:
948:
945:
942:
939:
936:
933:
930:
927:
924:
921:
918:
915:
912:
909:
906:
903:
900:
897:
894:
891:
888:
885:
882:
879:
876:
873:
870:
867:
864:
861:
858:
855:
852:
849:
847:thue_morse_bits
846:
843:
837:
818:
792:
746:
670:
665:
664:
661:
623:
546:
544:
507:
505:separate things
460:
456:
432:
405:
382:
365:
363:
357:
303:
302:
270:
252:
235:
195:
192:
189:
186:
185:
163:
156:
136:
107:on Knowledge's
104:
12:
11:
5:
1314:
1312:
1304:
1303:
1298:
1293:
1283:
1282:
1279:
1278:
1277:
1276:
1275:
1274:
1273:
1272:
1271:
1270:
1247:
1142:
1139:
1096:
1083:David Eppstein
1034:David Eppstein
842:
836:
833:
817:
814:
791:
788:
787:
786:
745:
742:
741:
740:
685:
682:
677:
673:
660:
657:
656:
655:
654:
653:
630:slower version
621:
620:
599:
597:
543:
540:
506:
499:
498:
497:
455:
452:
446:80.136.184.224
431:
426:
375:
374:
349:
348:
335:
332:
329:
326:
321:
318:
315:
311:
293:80.171.178.236
269:
266:
250:
248:
243:Hamming weight
234:
231:
228:
227:
224:
223:
220:
219:
208:
202:
201:
199:
182:the discussion
169:
168:
152:
140:
139:
131:
119:
118:
112:
101:
87:
86:
76:
70:
69:
24:
13:
10:
9:
6:
4:
3:
2:
1313:
1302:
1299:
1297:
1294:
1292:
1289:
1288:
1286:
1269:
1265:
1261:
1257:
1254:
1248:
1140:
1137:
1133:
1129:
1128:
1127:
1123:
1119:
1115:
1112:
1097:
1094:
1093:
1092:
1088:
1084:
1080:
1076:
1075:
1074:
1070:
1066:
1062:
1059:
1053:
1049:
1045:
1044:
1043:
1039:
1035:
1031:
1027:
1026:
1025:
1024:
1020:
1016:
1012:
1009:
840:
834:
832:
831:
827:
823:
815:
813:
811:
807:
803:
799:
789:
785:
781:
777:
773:
772:Deacon Vorbis
769:
765:
764:
763:
762:
758:
754:
750:
743:
738:
734:
730:
726:
722:
714:
709:
708:
707:
701:
697:
683:
680:
675:
671:
658:
652:
648:
644:
640:
636:
635:
634:
633:
618:
614:
610:
606:
605:Deacon Vorbis
600:
598:
596:
592:
588:
584:
583:Deacon Vorbis
580:
576:
572:
571:
570:
569:
565:
561:
541:
539:
538:
534:
530:
525:
522:
519:
516:
513:
510:
504:
500:
496:
492:
488:
484:
480:
479:
478:
476:
472:
468:
467:76.183.88.237
464:
453:
451:
450:
447:
441:
440:
437:
436:80.136.165.54
430:
427:
425:
421:
417:
413:
409:
400:
398:
394:
390:
389:77.40.128.194
386:
379:
373:
368:
360:
355:
351:
350:
330:
324:
313:
301:
300:
299:
297:
294:
289:
286:
282:
279:
276:
273:
267:
265:
264:
260:
256:
249:
246:
244:
238:
232:
217:
213:
207:
204:
203:
200:
183:
179:
175:
174:
166:
160:
155:
153:
150:
146:
145:
141:
135:
132:
129:
125:
120:
116:
110:
102:
98:
93:
92:
77:
74:
67:
63:
59:
58:combinatorics
55:
54:number theory
51:
50:
46:... that the
45:
42:
41:
39:
38:
33:
29:
25:
22:
18:
17:
1252:
1110:
1078:
1057:
1050:rather than
1007:
995:
838:
819:
796:— Preceding
793:
749:This article
747:
719:— Preceding
705:
662:
639:sonification
556:
526:
523:
520:
517:
514:
511:
508:
502:
461:— Preceding
457:
442:
433:
406:— Preceding
401:
380:
376:
290:
287:
283:
280:
277:
274:
271:
253:
247:
239:
236:
212:Low-priority
211:
171:
137:Low‑priority
115:WikiProjects
47:
44:Did you know
43:
37:Did you know
35:
27:
26:A fact from
434:Just FYI.--
383:—Preceding
187:Mathematics
178:mathematics
134:Mathematics
1285:Categories
1134:or fails
487:Gandalf61
483:bitstream
412:Rmrichman
83:Knowledge
32:Main Page
1264:contribs
1256:uantling
1231:<<
1222:<<
1122:contribs
1114:uantling
1069:contribs
1061:uantling
1019:contribs
1011:uantling
976:<<
922:<<
913:<<
798:unsigned
733:contribs
721:unsigned
463:unsigned
420:contribs
408:unsigned
385:unsigned
354:Monopoly
298:Janosch
1136:WP:NOTE
1048:WP:CALC
643:sofias.
560:sofias.
366:whisper
359:Jouster
214:on the
105:C-class
34:in the
1240:return
949:return
780:videos
776:carbon
613:videos
609:carbon
591:videos
587:carbon
454:Spaces
111:scale.
1180:range
1132:WP:OR
1052:WP:OR
1030:WP:OR
880:range
768:WP:RS
753:Paddy
725:EZ132
573:From
503:three
66:chess
1260:talk
1243:bits
1219:bits
1210:bits
1204:bits
1201:bits
1192:bits
1162:bits
1118:talk
1087:talk
1065:talk
1038:talk
1015:talk
998:bits
961:bits
937:bits
901:bits
892:bits
862:bits
826:talk
822:Rich
806:talk
770:. –
757:talk
729:talk
647:talk
564:talk
533:talk
529:Daqu
491:talk
471:talk
416:talk
393:talk
272:Hi,
259:talk
64:and
1171:for
1144:def
1004:. —
871:for
844:def
663:If
310:lim
206:Low
1287::
1266:)
1262:|
1237:))
1189:):
1177:in
1156:):
1124:)
1120:|
1089:)
1071:)
1067:|
1040:)
1021:)
1017:|
928:))
898:((
889:):
877:in
856:):
828:)
808:)
782:)
778:•
759:)
735:)
731:•
706:?
649:)
615:)
611:•
593:)
589:•
577:,
566:)
535:)
493:)
473:)
422:)
418:•
395:)
370:)
320:∞
317:→
291:--
261:)
60:,
56:,
1258:(
1253:Q
1249:—
1234:i
1228:1
1225:(
1216:(
1213:-
1207:=
1198:~
1195:=
1186:n
1183:(
1174:i
1168:0
1165:=
1153:n
1150:(
1116:(
1111:Q
1085:(
1063:(
1058:Q
1036:(
1013:(
1008:Q
991:"
988:}
985:b
982:}
979:n
973:1
970:{
967:0
964::
958:{
955:"
952:f
946:)
943:1
940:+
934:(
931:-
925:i
919:1
916:(
910:)
907:1
904:+
895:=
886:n
883:(
874:i
868:0
865:=
853:n
850:(
824:(
804:(
774:(
755:(
727:(
684:1
681:=
676:k
672:T
645:(
607:(
603:–
585:(
562:(
531:(
489:(
469:(
414:(
391:(
362:(
334:)
331:n
328:(
325:a
314:n
257:(
218:.
117::
75:.
68:?
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
