Services & Resources / Wolfram Forums
-----
 /
MathGroup Archive
2001
*January
*February
*March
*April
*May
*June
*July
*August
*September
*October
*November
*December
*Archive Index
*Ask about this page
*Print this page
*Give us feedback
*Sign up for the Wolfram Insider

MathGroup Archive 2001

[Date Index] [Thread Index] [Author Index]

Search the Archive

Recursive Rules

  • To: mathgroup at smc.vnet.net
  • Subject: [mg31147] Recursive Rules
  • From: "Mark S. Coleman" <mcoleman at bondspace.com>
  • Date: Sat, 13 Oct 2001 02:47:12 -0400 (EDT)
  • Sender: owner-wri-mathgroup at wolfram.com

Greetings,

I know that a recurrent/recursive function can be written 

f[t_] := f[t] = a + b*f[t-1].

So that once an initial value is stipulated, e.g., f[0]=0, then the 
function "remembers" past values and can correctly calculate f[] for 
any t. 

I was wondering if it was possible to do the same thing with a Rule?

Thanks,

-Mark


  • Prev by Date: Re: another question.
  • Next by Date: Problem with building mathlink programs
  • Previous by thread: Re: Solving simultaneous equations with inequalities
  • Next by thread: Re: Recursive Rules