recursion theorem (under construction)
Many mathematical objects, such as natural numbers, lists, and trees, are defined recursively in terms of basic components and composition rules. The Recursion Theorem shows that functions defined recursively on such objects are well-defined.
This concept is still under construction.
This concept has the prerequisites:
- be able to use the Recursion Theorem to define functions over recursively defined structures
- prove the Recursion Theorem
-No Additional Notes-
- create concept: shift + click on graph
- change concept title: shift + click on existing concept
- link together concepts: shift + click drag from one concept to another
- remove concept from graph: click on concept then press delete/backspace
- add associated content to concept: click the small circle that appears on the node when hovering over it
- other actions: use the icons in the upper right corner to optimize the graph placement, preview the graph, or download a json representation