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.
Talk:ℒ
Jump to navigation
Jump to search
Super-ℒ-complete
Is it possible for a language to be super-ℒ-complete? Or perhaps even weak outside super-ℒ-completeness? Or am I letting my imagination run too wild, and/or I'm misinterpreting something? —CreeperBomb (interact in such a way to use diction in order to achieve the result of conversation or other form of communicating an idea or group of ideas between individuals including myself) 20:36, 9 December 2023 (UTC)
- Exceptions to a language equivalency seem to require exceptionally superlinguistic qualities.
- As such, an example would be Flow of Holes. The exceptional feature is that numbers of legal Flow of Holes programs is equal to the corresponding tiger hash(else simply equivalent.) Miui (talk) 17:46, 19 May 2026 (UTC)