summaryrefslogtreecommitdiffstats
path: root/content/zettel/1b4.md
diff options
context:
space:
mode:
Diffstat (limited to 'content/zettel/1b4.md')
-rw-r--r--content/zettel/1b4.md16
1 files changed, 16 insertions, 0 deletions
diff --git a/content/zettel/1b4.md b/content/zettel/1b4.md
new file mode 100644
index 0000000..fed01ce
--- /dev/null
+++ b/content/zettel/1b4.md
@@ -0,0 +1,16 @@
++++
+title = "Converting any recursive function"
+author = "Yann Herklotz"
+tags = []
+categories = []
+backlinks = ["1b3"]
+forwardlinks = ["1b5"]
+zettelid = "1b4"
++++
+
+The problem with synthesising arbitrary recursive functions is that they
+require a stack. The stack saves the state of all the functions that are
+live before the recursive function call happens, so that the function
+can continue normally afterwards. Saving the state on the stack is
+inexpensive in software normally, as memory is abundant, however, in
+hardware it is quite expensive and slow to save variables on the stack.