Recursion: Difference between revisions
Fractalguy (talk | contribs) No edit summary |
Fractalguy (talk | contribs) mNo edit summary |
||
| Line 1: | Line 1: | ||
An [[algorithm]] that uses the output for one [[iteration]] as the input for the next is [ | [[File:Recursive-computer-generated-tree-algorithm-feedback-loop.jpeg|thumb|Tree generated with a simple recursive algorithm]] | ||
An [[algorithm]] that uses the output for one [[iteration]] as the input for the next is [[wikipedia:Recursion|recursive]]. | |||
[ | [[wikipedia:Recursion|Recursion]] is behind [[feedback loops]] in nature and [[fractal]] equations. These concepts are [[necessary prerequisites]] to understanding [[metaculture]]. | ||
The notion of [[meta]] is recursion in thought. | The notion of [[meta]] is recursion in thought. | ||
Revision as of 19:29, 24 January 2024
An algorithm that uses the output for one iteration as the input for the next is recursive.
Recursion is behind feedback loops in nature and fractal equations. These concepts are necessary prerequisites to understanding metaculture.
The notion of meta is recursion in thought.
See also Gödel's Incompleteness Theorems.
This one is a quick intro from a coding point of view.
This explanations recursion and how it relates to fractals and the building blocks of nature.
lol math dealer... kinda slaps tho