4 ms·
Do you know that not every sequence is easily computable ? Like, most of them isn't. Even if you have an algorithm to compute them. I appreciate your optimism
by _ache_ 4y ago
Do you know that not every sequence is easily computable ?
Like, most of them isn't.
Even if you have an algorithm to compute them. I appreciate your optimism thought. But OEIS is made by pretty smart people, if it was so simple, it would have been made.
It would be great to make it when possible but the bias will remains.
- saghm 4y agoI don't think they're criticizing the OEIS's approach for storing sequences, but the person who decided to use their prefixes to draw conclusions about which numbers are "boring".
- travisjungroth 4y ago> if it was so simple, it would have been made I don't believe this to be true. Maybe the people who make OEIS have been satisfied with having the description and a few examples. It would only work well for strictly increasing sequences. I don't know of any sequence that increases slowly and is difficult to compute. If it increases quickly, then you'll quickly pass the limit. If it's not increasing, then you'd have to prove which numbers are under the limit and that could be very challenging in some cases.
- ratmice 4y agoThe first thing that came to mind for slowly increasing worth looking into seemed like it might be the inverse ackermann function, which curiously I didn't find any OEIS entry for.
- unkulunkulu 4y agoInverse ackerman should be easy to compute by computing ackerman for enough terms and inversing numerically? I mean, it will be the same number basically for a looooong time