@Charlie hm... what a strange library?! But... we have special books that could be given only for one time during all study in university. What happened?
writing about AI and found this on an essay "I think there is a mathematical theorem stating that meaningful strings in a structured language have unique interpretations if their lengths exceed some rather small bound. I don't know how to formulate such a theorem. " anyone know what thisis?
hm im not sure thats right @jdoe looked it up and from what i can read it seems like its more abuot the decriptive length being related to the length of a string and not the amount of interpretations of a natural language
we make a switch from usual addition and multiplication operations to a structure (idempotent semiring) with usual multiplication but with idempotent addition $a \oplus b = \max(a,b)$
For functions, for real numbers, for matrices, for topologies, whatever. We define what we mean when we say two things are equal. Or maybe better, equivalent.
One short question: Is it legitimate to write [0;1,1,1,...,n] for a infinte continued fraction? Because I am not sure wheter [0;1,1,1,...,n] is finite if and only if n=1, but for different n is infinite
I dont want to check $[0;\bar 1]$, because it is clear that this is finite. I am interested in [0;1,1,1,...,n]. The infinite item should be n>1, every other item =1
They should be symbolized as infnite dots. I have this sequence, here: $x_{n+1}=1/(1+x_n)$ for a random starting point x_0 > 0 and thought it might be possible to write it as an infinite continued fraction