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.
Candy
Jump to navigation
Jump to search
Candy is an esoteric programming language made by User:Dragoneater67 in 2026.
Overview
The program has access to a circular finite tape of unbounded nonnegative integer cells initialized to all 0s. Instructions are executed left-to-right. The program halts when EOF is reached.
| Instruction | Description |
|---|---|
> |
Move tape head right. |
} |
Increment the cell at the tape head and move tape head right. |
! |
If the cell at the tape head is equal to the cell to the right of the tape head, jump back to start. |
Computational class
Candy is Turing complete since it is equivalent to Brainpocalypse:
| Brainpocalypse | Candy |
|---|---|
} |
>>} followed by > repeated N-1 times where N is the amount of cells in the tape.
|
- |
!>} followed by > repeated N-2 times where N is the amount of cells in the tape.
|
Every Brainpocalypse cell is simulated by a pair of Candy cells.