Wolfram Research

Mathematica MathWorld Wolfram Science More »

HOME

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.


	Contributed by: Stephen Wolfram Based on: A live experiment at the 2003 NKS Summer School

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.

"Call Graphs of Nestedly Recursive Functions" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/CallGraphsOfNestedlyRecursiveFunctions/

Contributed by: Stephen Wolfram

Based on: A live experiment at the 2003 NKS Summer School

Report an issue »

Interact with Demonstrations using the latest version of the free Mathematica Player—Download Now

Browse all topics

	Source page:
	Email	Name (optional)
	Occupation (optional)	Organization (optional)
	I use Mathematica often occasionally never
	Country (optional) Remember me
	Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed. Privacy Policy »

Wolfram Research

Site Index

RSS

Atom