Oliveira, João Batista Souza deJoão Batista Souza deOliveiraFigueiredo, Luiz Henrique deLuiz Henrique deFigueiredo2021-04-222021-04-222001Reliable Computing 8 (2): 131-138 (2002-04-01)http://hdl.handle.net/11420/9352Viswanath has shown that the terms of the random Fibonacci sequences defined by t = t = 1, and t = ± t ± t for n > 2, where each ± sign is chosen randomly, increase exponentially in the sense that n√|t | → 1.13198824... as n → ∞ with probability 1. Viswanath computed this approximation for this limit with floating-point arithmetic and provided a rounding-error analysis to validate his computer calculation. In this note, we show how to avoid this rounding-error analysis by using interval arithmetic. 1 2 n n-1 n-2 nen1573-134020012131138KluwerInformatikMathematikJournal Article10.1023/A:1014702122205Other