# Talk:The Complexity of Songs

WikiProject Computing / Software / CompSci (Rated C-class, Low-importance)
This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
C  This article has been rated as C-Class on the project's quality scale.
Low  This article has been rated as Low-importance on the project's importance scale.

## S1

${\displaystyle S_{1}}$ is undefined. —The preceding unsigned comment was added by 216.232.222.122 (talkcontribs) .

No, S1 is defined in terms of S0. —Keenan Pepper 21:09, 27 May 2006 (UTC)
Actually, it wasn't, since that definition was stated as being for values of k strictly greater than 1. I've fixed it now. --Tango 22:17, 8 June 2006 (UTC)

## \epsilon

The first part of the definition should use an epsilon ε rather than the letter e. Wcbarksdale 14:27, 9 July 2007 (UTC)

This blog post, "The descriptive complexity of songs" notes that the song "${\displaystyle 10^{n}-1}$ botthels on a wall" has complexity O(log log n) and makes other interesting remarks. Unfortunately refs to blogs are invalid for wikipedia. - Altenmann >t 20:05, 7 January 2013 (UTC)