Wolfram Demonstrations Project
7899

Call Graphs of Fibonacci-Like Functions

In a recursively defined function, for a particular n is computed by "calling" the function f with different arguments n. This Demonstration shows the graph of "calls" made, for various Fibonacci-like recursive definitions.

SNAPSHOTS

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

RELATED LINKS

PERMANENT CITATION

"Call Graphs of Fibonacci-Like Functions" from the Wolfram Demonstrations Project
 http://demonstrations.wolfram.com/CallGraphsOfFibonacciLikeFunctions/
Contributed by: Stephen Wolfram




Related Topics




Contribute




 
RELATED RESOURCES
Mathematica »
 The #1 tool for creating Demonstrations
and anything technical. 		Wolfram|Alpha »
 Explore anything with the first
computational knowledge engine. 		MathWorld »
 The web's most extensive
mathematics resource. 		Course Assistant Apps »
 An app for every course—
right in the palm of your hand.
Wolfram Blog »
 Read our views on math,
science, and technology. 		Computable Document Format »
 The format that makes Demonstrations
(and any information) easy to share and interact with. 		STEM Initiative »
 Programs & resources for
educators, schools & students. 		Computerbasedmath.org »
 Join the initiative for modernizing
math education.
Powered by Wolfram Mathematica © 2012 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+