I really appreciate the care you've applied to the writeups.
A quick question: for your purposes, is it sufficient that the f(n) generates reasonable output in constant time when iterated, or must it be capable of arriving at the same value for n no matter whether it has just previously been called for n - 1 (what I think you refer to as "random access")?
Statistics: Posted by tseaver — Wed Aug 28, 2024 5:52 am