Minor additions :)

3 files changed, 45 insertions, 1 deletions

diff --git a/samples/fun/goldbach.bruijn b/samples/fun/goldbach.bruijn
new file mode 100644
index 0000000..2592a40
--- /dev/null
+++ b/samples/fun/goldbach.bruijn
@@ -0,0 +1,20 @@
+# Tromp's version, will reduce to [0] iff Goldbach conjecture is false
+:import std/Combinator .
+
+zero [[1]]
+
+one [[0]]
+
+sieve y [[[0 one (2 sn1 f)]]]
+	f y [sn2 0]
+		sn2 [[0 (0 4 1)] [[[[0 2 (1 3)]]]]]
+	sn1 [[0 (0 3 1)] [[[[0 2 (1 3)]]]]]
+
+zeroS [[[[0 zero (1 3)]]]]
+
+primes sieve zeroS
+
+check y [[[[[primes 0 (1 (4 0))] testp1]]]]
+	testp1 [0 0 2 [0 4] 0]
+
+main primes (check [[[[0]]]])
diff --git a/samples/fun/halting_problem.bruijn b/samples/fun/halting_problem.bruijn
new file mode 100644
index 0000000..dd7e6d6
--- /dev/null
+++ b/samples/fun/halting_problem.bruijn
@@ -0,0 +1,10 @@
+:import std/Logic .
+
+# hypothetical halting decider (shall not loop)
+# assuming (Program Arg) reduces to boolean
+halting [[halts (1 0)]] ⧗ Program → Arg → Boolean
+	halts [0 true false]
+
+# basically y combinator
+# paradox!
+e halting [¬(halting 0 0)] [¬(halting 0 0)]
diff --git a/samples/fun/huge.bruijn b/samples/fun/huge.bruijn
index 2d963ad..2f36dc1 100644
--- a/samples/fun/huge.bruijn
+++ b/samples/fun/huge.bruijn
@@ -1,4 +1,18 @@
 # "bruijn huge.bruijn"
+# some of the fastest growing functions per blc length
+
 # 55 bits inflating to 65536 bits, John Tromp
+huge-55 [[0 0 0 0 [[0 [[0]] 1]]] (+2u)
+
+# 64 bits inflating to ??? bits, John Tromp
+huge-64 [0 0 h 0 0 0] (+2u)
+	h [[[0 2 1 0]]]
+
+# 79 bits inflating to ??? bits, John Tromp and Bertram Felgenhauer
+huge-79 [0 0 e 0] (+2u)
+	e [0 g [[0]] d0 0]
+		g [[1 (d 0) (0 [0])]]
+			d [[[2 [2 0 1]]]]
+		d0 [[1 0 0]]
 
-main [[0 0 0 0 [[0 [[0]] 1]]] [[1 (1 0)]]]
+main huge-64