Ancestors

Written by Oscar Cunningham on 2024-11-15 at 18:03

Are there any interesting integer sequences that contain every finite string of natural numbers as a contiguous substring? In particular ones that try to do so as efficiently as possible? Like the index at which a string first appears isn't too much greater than the number of 'simpler' strings, in some sense.

[#]Math #Maths #Mathematics

=> More informations about this toot | More toots from OscarCunningham@mathstodon.xyz

Toot

Written by Lilac on 2024-11-15 at 18:20

@OscarCunningham

i'm probably missing something, but isn't the number of strings of natural numbers uncountable?

=> More informations about this toot | More toots from lilacperegrine@clockwork.monster

Descendants

Written by Oscar Cunningham on 2024-11-15 at 21:42

@lilacperegrine As @glocq worked out, I meant that the finite strings of natural numbers should be contiguous substrings.

=> More informations about this toot | More toots from OscarCunningham@mathstodon.xyz