|
|
|
|
|
by nyssos
964 days ago
|
|
> There are infinite many such strings And they can be enumerated by a finite program. For example, in lazily evaluated pseudocode: bits = ["0", "1"]
bitstrings = bits + [(bit + suffix for bit in bits) for suffix in bitstrings]
|
|