I've written a number of little scripts over the years, many of which I use every day. Here's a little collection.

I use z-run for something like this.

Timelinize unifies and organizes your digital life on your own computer.

The safest and most reliable way to deal with feature flags is to hardcode them

In 2015 I got rid of everything I owned that didn’t fit in a laptop backpack, and I’ve been living at this level of minimalism since. The idea is to only own what I need, which allows me to focus more, spend less, travel spontaneously and simplify my life.

Running on weird hardware or something.

Reminding myself just how much you can do with CSS these days.

Фестиваль эргономичных девайсов

A site with statistics regarding the decentralization status of various web services

Fediverse: yes
The Atmosphere and Git forges: no

One of the most controversial things I believe about good software design is that your code should be more flexible than your domain model. This is in direct…

How to minimize user frustration in Antarctica.

How you engage with the world changes how you experience the world, and how the world experiences you.

Instance of Xobaque

Karl Voit with another banger.

Прошло более 20 лет с того момента, когда тарифы на мобильную связь указывались в у.е., а GPRS трафик подразделялся на GPRS-Internet и GPRS-WAP. Последний был довольно дорогим способом почитать...

A Markdown document that has 24 possible renderings, depending on the renderer.

Before the large-scale use of fossil fuels, removable textile layers kept homes warm in winter and cool in summer.

Not a single mention of textile collecting dust

Maltron has a better thumbcluster

A role-playing dungeon crawler game for DOS

Бизнес на агродронах

Plaintext emails are slowly becoming an artifact of the past. Still, there’s a lot interesting things about plaintext emails. Including... plaintext-only formatting!

Чайный блог. Свежая и интересная информация о выращивании, сборе и производстве китайского чая. Чайная история, культура чаепития.

О вкусе и аромате чаев можно спорить бесконечно. Но вот о безопасности и качестве напитка лучше рассуждать, когда имеешь веские доказательства. Поэтому эксперты Роскачества закупили, обезличили и отправили в крупную лабораторию 48 товаров: черный чай самых популярных торговых марок. Как листовой, так и в пакетиках. Что искали и почему? Читайте далее.

Markov algorithms have received very little attention in the studies about formal languages, so the purpose of the present paper is twofold: i) to characterize languages in terms of Markov algorithms, and ii) to produce automatically Markov algorithms accepting or parsing languages generated by given grammars.

We use a particular, although universal, subclass of Markov algorithms, which we call “pointer Markov algorithms»; we obtain a characterization of: i) regular, ii) deterministic context-free, and iii) type O languages, which is quite «natural» in terms of these algorithms. Furthermore, we show that, given a right linear or a strongLL(k) grammar, it is possible to produce automatically a pointer Markov algorithm parsing the language generated by the grammar. These constructions are particularly interesting because pointer Markov algorithms can be compiled conveniently into machine code programs.

In the study of fundamental properties of algorithms, attention is often given to classes of abstract general procedures. Of these, the Markov algorithm has some claims to favour owing to the simplicity of its semantics, the relative power of its basic operations and its independence of numerical concepts. Such a study will generally be assisted by some practical experience in using the methods introduced.

The Markov algorithm [1, 2] can be used as a language parser and as means fordefining languages [2–5]. This work is concerned with the amount of computing time which the algorithm requires. Computing time is measured by the number of comparisons between the rules of the grammar and the input string. A modification is introduced into the algorithm which reduces the computation time. It is proved that under certain conditions imposed on the rules of the grammar the computing time required by the modified algorithm is bounded linearly by the length of the input string. One set of such conditions requires that each application of a grammar rule reduces the length of the input string. Another set requires that each application does not increase the length of the input string and that the graph associated with the rules of the grammar satisfies certain restrictions.

Code is read more than it is written, but it is skimmed more than it is read, so we should write code that is clear at a glance.

I see a positive mention of math notation. The article is probably wrong as hell. Will take a closer look later.

Chawan is a text-mode web browser and pager for Unix-like systems, with a focus on implementing modern web standards while remaining self-contained, easy to understand and extensible.

It includes functionality like CSS, inline images inside the terminal, and JavaScript through a small, independent browser engine.

Open this URL in a browser https://api.telegram.org/bot{our_bot_token}/getUpdates

Why I Erased 10,000 Notes, 7 Years of Ideas, and Every Thought I Tried to Save

Insightful

Delegating behavior to objects rather than invoking utility methods leads to cleaner, more extensible, and properly encapsulated object-oriented design.

In cooperation with IEEE Computer Society the event is focused on static analysis, program verification, bug detection, and software maintenance.

In Yekatirinburg! Might attend, if exams allow.

Выбор воды — решающий момент в успешном чаепитии. Вода либо раскрывает чай правильно и вкусно, либо меняет интенсивность оттенков в худшую сторону, оставляя нас с носом и невкусным чаем.

Черноголовка и Святой Источник норм. У Черноголовки смешные бутылки в 2.5 л, это им в плюс