Moritz Schauer

Please reopen codegolf.stackexchange.com/questions/195634/draw-a-fuzzy-grid

hi, does anybody know the link to a first prototype of I believe J in something like 15 lines of C which was mentioned in an article available online I cannot find anymore? it really bothers me to have lost that

i posted a script generating the answer. i am a bit more lucky than you that julia has a isidentifier function

julia can have 126427 snippets

thanks

Sad.

Q: How do you deal with tied winners usually?

it agrees quite well with your graph

the first formula is valid if only numbers with digit 7 are unspeakable, the second is closer when also numbers divisible by 7 are unspeakable

f(k0) = begin k=k0;i=0;while k > 1;i+=1; k = k*(1 - k^(log(10,9/10)));end; println(log(i,k0)); i; end

i have a probabilistic way to compute it

thank you

to be specific, when i is the number of ones and k the length, I thought i = log(alpha,k) and you showed i = k^alpha

and you showed that it is infact polynomial in the length of the sequence

no, so initially i and some others thought that the number of new levels in the sequence is of logarithmic order

i was curious why your algorithm breaks down when the number of ones grows logarithmically instead of polynomially (or did I not get this right?)

ah, hi

see previous message

@GabrielBenamy

exploringbinary.com/…