diff options
| author | Preston Pan <preston@nullring.xyz> | 2024-01-25 17:39:10 -0800 |
|---|---|---|
| committer | Preston Pan <preston@nullring.xyz> | 2024-01-25 17:39:10 -0800 |
| commit | 82f41dfb0de5bd5a9a018a9ca3e50613f2bccf8b (patch) | |
| tree | 81cc1d68c47f08cc7e4dbef54854067758e327a6 /mindmap/recursion.org | |
| parent | bb30a8b92f1dac2e08bd6ec7014f8c6ce7b359db (diff) | |
able to run stem code due to org-babel-execute!
Diffstat (limited to 'mindmap/recursion.org')
| -rw-r--r-- | mindmap/recursion.org | 9 |
1 files changed, 7 insertions, 2 deletions
diff --git a/mindmap/recursion.org b/mindmap/recursion.org index 3cc2a12..cbf6dad 100644 --- a/mindmap/recursion.org +++ b/mindmap/recursion.org @@ -105,9 +105,14 @@ procedure is exactly the same as popping those values off a stack! ** Stacks Describe Recursion To see more transparently how stacks relate to recursion, we use my programming language stem, which is a concatenative programming language, as a more transparent example. -#+begin_src stem -factorial [ dup 0 <= [ 1 + ] [ dup 1 - factorial * ] ] def +#+begin_src stem :exports both +factorial [ dup 0 <= [ 1 + ] [ dup 1 - factorial * ] if ] def +5 factorial . #+end_src + +#+RESULTS: +: 120 + * TODO Recursion Describes…? * TODO Recursion is not Recursive |