↡

↡

↡

Paradigm(s)	math-only, base 2
Designed by	HeckYeah100
Appeared in	2025
Computational class	Finite state automata (FSA)
Reference implementation	Unimplemented
Influenced by	Non

This is a very esoteric programming language developed by HeckYeah100. It is a way to make the programming language Non more painful, which is derived from BF.

Overview

This programming language is unfortunately not Turing complete on its own and is only capable of performing math in base 2. It can only become Turing complete when used in conjunction with Non. The cool thing is that it can still be used to produce a FSA (Finite State Automata) by having the input represent the memory, as ↡ has no built-in memory storage.

Characters

Instruction	Description
`\`	Value of 0.
`↑`	Value of positive 1.
`↟`	Value of positive 2.
`↓`	Value of negative 1.
`↡`	Value of negative 2.
`/`	Repeats the operation(s) inside until the calculated value of the operation(s) inside is equal to 0, then continues after the closing `/`.
`~`	This operator prints whatever number was last calculated.

Syntax

The syntax is straightforward if you understand the functions of the characters. Too add, you would put your first number to add in one line like this,

↑

and then in the next line put the second count to be added;

↑

Now, you should get an output of:

↟

There is no subtracton mechanic needed as there are negative characters in this language and subtraction can just be preformed by adding a negative. A special rule: If the number calculated becomes greater than 2, it carries over into another character. To show the value 4, you would write `↟↟`.

Examples

Add 2 to 0 until it equals 10

↟
↟
↟
↟
↟ 
~

the output would be as follows

↟↟↟↟↟