The Fibonacci quarterly · 1982 · 76 citations · 2 references
ComputingComputer ScienceMathematicsAlgebraSequence AnalysisTheory Of ComputationRecurrence RelationsRecursion TheoryRecurrenceRecursion
The terms of a recursive sequence are usually defined by a recurrence pro-cedure; that is, any term is the sum of preceding terms. Such a definition might not be entirely satisfactory, because the computation of any term could require the computation of all of its predecessors. An alternative definition
2
Mark Feinberg · The Fibonacci quarterly · 1963 · 76 citations
Charles Safran · PubMed · 1991 · 64 citations