Here are my recollections. I’ll put only professional stuff, the personal part is not for share. (The long term effect of being physically confined with only the close family is great and one thing that everybody could relate, I hope.)
I don’t write this as self-promotion, is a sort of self-justification. “What did you do during this pandemic? …”
As you know some years before the pandemic I arrived at the subject of molecular computers, following the strange paths of mathematics and computation. This subject is still fresh, not enough explored and most likely supressed at least since 2017.
People have been hit with a life changing pandemic and they still rather study quantum computers. One thing I learned is that people (me included) are stubborn beyond reason.
At the end of 2019 I started to put in order the large quantity of published and unpublished research. It was a mess. It was not clear what chemlambda is and is not, the part about computing with space was still not appreciated enough. (The other thing people love a lot, besides quantum computing, is naive digital universes based on boomer mathematics. Don’t you know what boomer mathematics is? Like everything boomer, is something – mathematics in this case – from up to 1960′ glorified in a number of mediocre developments wrapped in self-congratulations. Fortunately mathematics evolved since then a lot and history will wipe all propaganda.)
Trying to make a presentable basis for this, I retraced my steps since then, and during the pandemic, and I finally made sense of the solution of the problem of computing with space. All pieces felt in place and is beautiful.
So the first thing I did was to put a basis for the chemlambda project, which you can see in the official chemlambda page. It was useful, even if only a basis. You have there now chemlambda v2, dirIC, a lambda calculus to chemlambda parser, quine graphs experiments, relations with Lafont’ Interaction Combinators, all pieces of stuff I wanted to have since years.
The second thing I did was to rescue (about a half) of the chemlambda collection of animations. Of course that this collection is not for admiring colored dots moving in pleasing ways, but a proof about how much can be done with purely local computing. How, please tell me, my dear experts, how did I invent all these molecules? Because they are living proof that asemantic computing does work.
As soon as I posted (in jan 2020) the collection, it was hit by a ddos attack. For almost a month.
In the spring and summer 2020 I worked on the various pieces of the official chemlambda page. I gave lots of private and some public talks. Put some articles in the arXiv. Produced abundantly commented scripts.
Then I was challenged to make what became chemSKI. Before I had not appreciated combinators as I should.
It became clear that behind a lot of the graphical rewriting stuff there is a computing with space part related to the shuffle move. This received the name pure see and is still in development. What is in there: a sort of semantics related to emergent algebras, but with implications for interaction combinators. A proof that both beta rewrite and the duplication rewrites are emergent, in a precise sense (people doing “linear” logic don’t even have this on their radar).
Coupled with the similar proofs and definitions of curvatures in sub-riemannian geometry, with the proof that the R3 rewrite emerges from a passage to the limit and that the defect from R3 measures curvature, this goes into completely new territory.
Now I enter into a phase where I had to take again the route of research on paper. It happened between nov 2020 and march 2021 and I want to wash the pandemic from my mind first and then I’ll show it. Is great!
This spring I started to do the same thing I did for the chemlambda project, but for other stuff, so I made the telegram chemlambda channel of long reads, which already has lots of things inside. Made also a github writings repository.
The COLIN implies LIN, asemantic computing and combinators stuff and the numbers exploration, started in em-convex, are partial, enough compelling results.
I forgot to tell you about Zip-slip-smash aka ZSS. It is a revision of zipper logic, which is a calculus with knots and zippers, which can implement interaction combinators. The meaning of it is related though again with emergent algebras, because the smash move is nothing else but the “look down” relation from the intrinsic sub-riemannian geometry treatment.
All in all, there are about:
- 10 technical articles
- lots of commented programs
- many talks to learn from
- chemSKI, dirIC, pure see, ZSS
- COLIN
- asemantic computing direction
- writings in new media