Call Graphs of Nestedly Recursive Functions

Nestedly recursive functions nestedly "call" previous instances of themselves. Even very simple recursion relations can lead to a complex sequence of values for nestedly recursive functions.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

The recursion relations are set up so that whenever they sample below n=1, the f[n] is taken to have value 1.
f[n]=3 f[n - f[n - 1]] is the simplest example that seems to yield complex behavior.
Functions like these were mentioned in A New Kind of Science, but first studied in detail in Stephen Wolfram's Live Experiment at the opening of the first NKS Summer School, in June 2003.
"Indirect calls" are instances of the "inner f" in the recursion relation.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.