https://yewtu.be/watch?v=IgF3OX8nT0w

This is mind-blowing! Analog computers designed about 100 years before the digital ones by Sir William Thomson, 1st Baron Kelvin himself. And used for pretty much the whole century! Apparently beside all of his numerous contributions to science, Sir Thompson was a Fourier analysis pioneer and popularizer.

More details on Wikipedia: https://en.wikipedia.org/wiki/Tide-predicting_machine

А в меню было написано "сырники"... 🧐

Корпорация Майкрософт приняла решение глубже локализовать голосового помощника Cortana для России и переименовать его в "Картавый". Активизируется фразой "Слышь, Картавый!"

https://karpathy.github.io/2022/03/14/lecun1989/
Andrej Karpathy "reproduced" seminal Yann LeCun et al. paper " Backpropagation Applied to Handwritten Zip Code Recognition" from 1989 that basically introduced convolutional neural networks to the world. Karpathy's reflections and speculations for the next 33 years are something to think about.

https://lawrencecpaulson.github.io/2022/03/16/Types_vs_Sets.html

An insightful piece on "types vs. sets" from Lawrence Paulson (of Isabelle fame) himself with rich historical references.

On the other hand it's pretty terse and assumes close familiarity with both Type Theory and Set Theory. And Category Theory for bonus content.

https://lawrencecpaulson.github.io/2022/03/02/Type_classes.html

If you're not reading Paulson's blog already, here he gives a historical overview of Type Classes from programming languages to proof assistants.

Though keep in mind that in Haskell Multiparam Type Classes are a norm for ages, while Isabelle/HOL only supports Single-parameter Type Classes. I guess this limitation applies to the most of proof assistants.

Paulson's blog is a gift that keeps on giving:

If you think doing mathematics in a modern proof assistant is difficult, let me remark that doing mathematics in a formalised calculus is a bit like using the kind of proof assistant we had 40 years ago.

from https://lawrencecpaulson.github.io/2022/02/23/Hereditarily_Finite.html
😄

https://lawrencecpaulson.github.io/2022/02/09/Ackermann-example.html

I guess I just bound to repost almost every Paulson's post, but this one is insanely cool! More about the Ackerman function than you ever thought there is! 😄

https://blog.burntsushi.net/transducers/

Did you know you can use an FSM as a data structure to implement both Sets and Maps? With fuzzy search and regex search? In a streaming fashion so you don't have to keep all of your data in RAM all the time?

Sounds too good to be true? In this somewhat old post Andrew Gallant describes how to do it with references to papers on FSM representation optimization and actual implementation in Rust. Plus some performance benchmarks.

In the last section Andrew discusses major limitations of the approach and some workarounds to partially mitigate them. Also you'll learn that this technique is employed in production inside Lucene and Elastic Search.

Только что позвонили спамеры из компании "Чёрная бухгалтерия". Я не шучу, так и представились: "компания "Чёрная бухгалтерия". 😳

https://proofassistants.stackexchange.com/a/940/333

This answer is golden, it links to all of the best materials on Type Theory and related subjects.

https://www.forbes.ru/forbes-woman/448097-koding-tol-ko-dla-devusek-zacem-sozdavat-zenskie-obrazovatel-nye-programmy-v-it

Обзорная статья, "на пальцах" рассказывающая про курсы и мероприятия "только для женщин" в сфере ИТ. За подробным обсуждением "не сексизм ли это" и почему, видимо, следует почитать FAQ от тех же Django Girls.

https://obua.com/publications/philosophy-of-abstraction-logic/2/

Abstraction Logic has been introduced in a previous, rather technical article. In this article we take a step back and look at Abstraction Logic from a conceptual point of view. This will make it easier to appreciate the simplicity, elegance, and pragmatism of Abstraction Logic. We will argue that Abstraction Logic is the best logic for serving as a foundation of mathematics.

I found this link somewhere in Paulson's blog. Haven't read but sounds ambitious! 😄

Turns out there's a metric for size increase for mechanized math dubbed "de Bruijn factor": https://www.cs.ru.nl/~freek/factor/

Apparently in practice it's around 4, and in some cases a hair bigger than 1. 🧐

https://mitchellh.com/writing/contributing-to-complex-projects

Some nice guidelines on becoming a contributor to a complex (open source) project.

Не трогал PowerPoint (MS Office в целом) лет 10 или около того. Но тут по случаю решил воспользоваться — думал, за то время что я на него не смотрел, он должен был сильно похорошеть. Но нет, Office от своих традиций не отходит! Вчера вечером сохранил презентацию — сегодня утром PowerPoint не может её открыть, говорит, нужно восстанавливать. Конечно же, восстановить он её тоже не смог — потерял половину слайдов. Самое смешное, что Only Office открыл её почти ровно в том виде, как она была сохранена, несмотря даже на "восстановление". 😂

Nah, Only Office lost all the formulae from all the slides after a couple of save-loads too. 😒

I'm watching an oldish talk by Guy Steele Jr.: https://www.youtube.com/watch?v=ftcIcn8AmSY
At the QnA session he mentions that lessons from the Fortress language somehow informed Julia's evolution... 🤔

And by the way regarding presentations. WPS Office saves the day. Apparently it reads pptx files better than MS Office and has no problems saving them back to disk. Though I've also exported to PDF just to be sure. 😁

Apparently "it's not a bug, it's a feature" can be traced back to 1922 the latest: https://plato.stanford.edu/entries/paradox-skolem/#2

[It] is not a paradox in the sense of an antinomy … it is a novel and unexpected feature of formal systems.

Jean van Heijenoort on Thoralf Skolem's Paradox. 😂

https://arxiv.org/abs/2203.16211
Lay-it-out: Interactive Design of Layout-Sensitive Grammars
Fengmin Zhu, Jiangyi Liu, Fei He

Layout-sensitive grammars have been adopted in many modern programming languages. However, tool support for this kind of grammars still remains limited and immature. In this paper, we present Lay-it-out, an interactive framework for layout-sensitive grammar design. Beginning with a user-defined ambiguous grammar, our framework refines it by synthesizing layout constraints through user interaction. For ease of interaction, a shortest nonempty ambiguous sentence (if exists) is automatically generated by our bounded ambiguity checker via SMT solving. The soundness and completeness of our SMT encoding are mechanized in the Coq proof assistant. Case studies on real grammars, including a full grammar, demonstrate the practicality and scalability of our approach.

It's effin' interactive framework utilizing SMT-solver and proved correct in Coq! Though I don't thing they mean "GUI" when they say "interactive framework".