Last modified: 04.11.2019.
Part of
(my pages to play and learn)
SKK -> I
omega combinator from S,K combinators
duplication with FOE of \x.((\y.yy)(xx))
(\a.aa)(\x.((\b.bb)(\y.yx)))
duplication with FO of \x.((\y.yy)(xx))
duplication with FOE of \x.(\f.ff)(\y.xy)
duplication with FO of \x.(\f.ff)(\y.xy)
duplication of M, then applied to id, for M = \x.(\f.ff)(\y.xy)
first (pair a b) where a and b come from FOE duplication of \x.(\f.ff)(\y.xy)
first (pair a b) with pair = \x.\y.\z. z x y and first = \p.(p (\x.\y.x)), a = 5, b = 0
Y combinator applied to something
Y combinator applied to id
omega combinator
ackermann_2_2
ackermann_3_2
the 10-nodes quine (sometimes it duplicates)
10 nodes sometimes becomes quine from [graph A-L-FI-FOE 540213]
dodecahedron
5 X 5 = (\m.\n.\f.m(nf)) 5 5
5 X 5 = (\m.\n.m (PLUS n) 0) 5 5, with PLUS = \m.\n.m SUCC n
GAMMA-GAMMA
DELTA-DELTA
GAMMA-DELTA
DELTA-GAMMA
DELTA-T
GAMMA-T
Lafont' quine
(stops at max.
1024
nodes
)
gravity:
CODE:
MOL NOW:
MOL AFTER:
load
reload
step
start
stop
before:
chosen:
after: