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.
AWA5.0
AWA5.0 is a bubble-based esoteric programming language themed after famous Phase Connect vtuber Jelly Hoshiumi. Temp-Tempai, the hardworking and heartbreakingly handsome creator, got inspired after watching her Shenzhen I/O stream. The purpose of the language is to allow Jelly to write programs in her native language (ex. "Awa awawa awawawa awa awa awawawa awawawawawawa....")
Due to this being a joke that has long outlasted its stay, only a brief description of AWA5.0 will be written here; please see the specification document below for a comprehensive understanding of the language.
AWA5.0 Structure
AWA5.0 is based around a FILO, theoretically infinite stack called the Bubble Abyss. The Bubble Abyss contains bubbles, aptly enough. These bubbles can contain either a simple integer value, or any number of other bubbles. As such, bubbles can be infinitely nested within one another.
The Bubble Abyss is interacted with through AWA5.0 commands, called Awatisms. Awatisms are written by AwaTalk encoded 5 bit unsigned integer values, followed by any parameter values also encoded in AwaTalk. AwaTalk is the method of encoding binary data into a string of text that is Jelly-Readable.
Also of note is AwaSCII, a revolutionary 6-bit take on ASCII that allows users of AWA5.0 to read in and print out text to/from the Bubble Abyss.
An AWA5.0 script always starts with an initial "awa", followed by a series of Awatisms. AWA5.0 is case insensitive.
Example AWA5.0 Script
The following AWA5.0 script prints "Awa" to the output.
| Awatism | Numerical Representation | AwaTalk Representation |
|---|---|---|
blo a |
5 2 |
awa awawa awawa awa awa awa awa awa awawa awa |
blo w |
5 3 |
awa awawa awawa awa awa awa awa awa awawawa |
blo A |
5 0 |
awa awawa awawa awa awa awa awa awa awa awa awa |
srn 3 |
9 3 |
awawa awa awawa awa awa awawawa awa |
prn |
1 |
awa awa awa awawa |
Final AWA5.0 Code
Awa awa awawa awawa awa awa awa awa awa awawa awa awa awawa awawa awa awa awa awa awa awawawa awa awawa awawa awa awa awa awa awa awa awa awa awawa awa awawa awa awa awawawa awa awa awa awawa
Computational Class
AWA5.0 is Turing-complete, despite its extremely limited control flow.
Control flow in base AWA5.0 involves jumping (jmp X) to labels (lbl X), where X is a number from 0 to 31. Therefore, AWA5.0 can only have at most 32 jumps.
Despite this, there have been multiple proofs that the language is Turing-complete, including a Bitwise Cyclic Tag interpreter.