The shortest closed λ-term that demonstrates this behavior is a triple η-expansion of the self-application combinator, namely λx.ω (λy.x (λz.y z)), where ω = λx.x x. github.com/codedot/lambda/is…
Oops: optimal reduction + embedded read-back + (λx.x x) (λx.M (λy.x y)) = a name clash. Try "(x: x x) (x: M (y: x y))" and compare 'standard' (optimal) with 'closed' (non-optimal) in MLC. codedot.github.io/lambda/
Anton Salikhmetov retweeted
Looking for a fun way to spend some time? We just learned about Spiral Graph at #aas234, which relies on citizen scientists to trace the spiral arms in galaxies. These arms can tell us whether the galaxies host elusive intermediate-mass black holes! zooniverse.org/projects/astr…
It seems "An Anomaly" unlocks if all symbols are put correctly throughout the game right after the last hexagonal communication.
