(Show HN?) There is a deep and lovely connection between the Y-combinator and the classic version of Godel's incompleteness theorem: https://gregfjohnson.com/incompleteness/
The notation used seems rather confusing, not even showing the list of arguments. For example, the argument swapping combinator C which is normally defined as
C f x y = f y x
is shown on this page as as y F x, which I can only make sense of by assuming that F is an infix function.
In Haskell you could use infix notation to define
I wish universal and eternal patterns like this were studied more often in software engineering. Perhaps we would have a chance in hell of finding canonical representations of common structures and even programs instead of basket weaving majors fucking reinventing the wheel every 5 minutes with yet another half-baked poorly understood Python or JavaScript instantiation of a common pattern. Imagine still writing for loops and munging indices instead of expressing things in terms of higher order functions like folds or maps...
Eh, I don't need to imagine; we're still stuck at that same level of infantilism. Instead of actually graduating to higher order atoms and primitives of thought though, we can just have the AI slop out another 100k LOC. Then the system will have so much incidental complexity that it becomes impossible to distill out its essence, because there no longer is one.
A bit of an aside: I wonder how much array-oriented languages like APL and J would benefit from being implemented on top of an interaction net machine?
41 comments
Eh, I don't need to imagine; we're still stuck at that same level of infantilism. Instead of actually graduating to higher order atoms and primitives of thought though, we can just have the AI slop out another 100k LOC. Then the system will have so much incidental complexity that it becomes impossible to distill out its essence, because there no longer is one.
---
const K =(a: A) => (_b: B) => a;
const S = (a: (x: C) => (y: B) => A) => (b: (x: C) => B) => (c: C) => a(c)(b(c));
const I = S(K)(K); const B = S(K(S))(K); const C = S(B(B)(S))(K(K)); const W = C(S)(I); const T = C(I); const V = B(C)(T); const I1 = C(C(I)); const C1 = B(C); const R1 = C1(C1); const V1 = B(R1)(C1); const I2 = R1(V);
const Z = B(W(I1))(V1(B)(W(I2)));