3 ms·
OK, thanks for the explanation. I think I understand what you mean. But this kind of generalisation takes very careful analysis to discern and I'm not convinced
by YeGoblynQueenne 5y ago
OK, thanks for the explanation. I think I understand what you mean. But this kind of generalisation takes very careful analysis to discern and I'm not convinced, yet. I'll be more easily convinced when I see something blatant, and n ≤ 10 is so far not there for me, even given the shift in what is predicted.
- Isinlor 5y agoI still don't know what you mean by n ≤ 10. Have you played around with the demo? http://recur-env.eba-rm3fchmn.us-east-2.elasticbeanstalk.com/ http://recur-env.eba-rm3fchmn.us-east-2.elasticbeanstalk.com... You can input there a sequence and it will predict the expression and next elements. For example, for the sequence: [3, 1, 8, 9, 18, 19, 37, 74, 92, 166, 332, 406, 738, 1476] It predicts: u_n = u_(n−1) + (u_(n−3) (n mod 3)) + u_(n−4) It's a really decent guess, and if I give it one more element (from 14 to 15 elements) it gets it correctly.
- YeGoblynQueenne 5y ago>> I still don't know what you mean by n ≤ 10. I mean the values of n_pred and n_op in tables 7 and 8. They go up to 10. I haven't tried the demo. Maybe I'll give it a go if you say it's so good.