We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
Do Minsk Family
Jump to navigation
Jump to search
| Paradigm(s) | Functional, Imperative |
|---|---|
| Designed by | User:Yayimhere |
| Appeared in | 2025 |
| Computational class | Mostly Turing complete, but varying. |
| Major implementations | None |
| Influenced by | Underload, Minsky machine, Do Minsk Family |
| Influenced | Do Minsk Family |
Do Minsk Family or DMF is an esolang family created by User:Yayimhere. These languages share the two commonalities that they all have inspired each other, and that (all most) all of them are proven turing complete by translation from Minsky Machine, or in other words, they all "Do Minsk".
A tree of all the languages
Here's an easy tree for you to browse:
. └── A Question of Protocol └── Noddity └── Karvity ├── TLQ │ ├── Stopload │ ├── Goto tag │ └── Viktor's Divisibility Checker └── Combine and continue └── Conquer and divide