Talk:Thue–Morse sequence

message: To me, the pseudocode was not very clear, especially considering indexOfHighestOneBit was neither implemented nor explained.
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 Hamming weight, and & 1 is like taking "modulo 2"/parity.
  import itertools
  def thue_morse():
    for n in itertools.count():
        yield n.bit_count() & 1
  for b in thue_morse():
      print(b, end=", ")
2605:A601:A621:3500:9C07:ED35:CE4A:8532 (talk) 04:50, 3 August 2023 (UTC)
thread_title:  Unclear code, my implementation 

message: Just FYI.--80.136.165.54 22:06, 8 July 2007 (UTC)
thread_title:  [[:Image:Morse-Thue sequence.gif]] 

message: 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 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.— Preceding unsigned comment added by 76.183.88.237 (talk) 04:36, 5 April 2012 (UTC)
replies: text: The clue is in the words "binary sequence" in the first sentence, which links to bitstream. However, since using spaces to divide up the sequence into blocks seems to have confused you, I have removed them. Gandalf61 (talk) 08:18, 5 April 2012 (UTC)
thread_title: Spaces

message: The article uses the term "Thue-Morse sequence" to mean at least three distinct things:
a) the sequence of finite strings 0, 01, 0110, 01101001, 0110100110010110, . . .
b) the successive overlaying of each of those finite strings on the first half of the next, to make one (semi-)infinite string 0110100110010110 . . .
c) the sequence of binary digits occurring in b).
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.
The article with its current confusion is very sloppy and hence inappropriate for an encyclopedia article.  
I hope someone more knowledgeable than I will fix this.Daqu (talk) 08:23, 7 July 2014 (UTC)
thread_title:  Article conflates '''three''' separate things 

message: If T_k = 1: turn right 90°. Then go forward. Can anyone prove that the instructions I gave draw ?
:A map of how frequently a point is visited is given here (larger dot = greater frequency) — Preceding unsigned comment added by EZ132 (talk • contribs) 21:04, 14 August 2019 (UTC)
thread_title:  Thue-Morse sequence curves 

message: This article has info on extensions to sharing fairly between more than two and Python code. Is it worth including? --Paddy (talk) 12:07, 11 September 2019 (UTC)
replies: text: That isn't an article so much as a blog post, and so it seems to fail to be a WP:RS.  –Deacon Vorbis (carbon • videos) 12:28, 11 September 2019 (UTC)
thread_title: More than two? Code?

message: 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 )  — Preceding unsigned comment added by 2A01:E0A:225:9A60:80A3:4C2D:8276:F28 (talk) 12:00, 21 January 2022 (UTC)
thread_title:  renaming the page Prouhet–Thue–Morse 

message: article might have original research, and I am actually concerned that the writing might be contrived to direct credit to particular researchers.Rich (talk) 21:46, 27 April 2022 (UTC)
thread_title:  Original research?