` is a minimalistic esoteric language created by User:Iamcalledbob that was designed to have only one instruction, while being somewhat usable for computation.
There is an infinite tape, which has cells. Cells can contain a number, negative or positive. The maximum value of a cell isn't specified. If anything is assigned to cell number 0, print the ASCII character of what is assigned.
|A`+B||Set address A to the value B.|
|A`B||Set address A to the value of address B.|
|+A`+B||If the latest assigned value equals A, jump B instructions in code relatively. Or else do nothing. B can be a negative in order to jump backward.|
|+A`B||If the latest assigned value equals A, jump the value of address B instructions in code relatively. Or else do nothing. Value of B can be a negative in order to jump backward.|
|Any invalid instruction||Is ignored.|
When jumping to or just reaching the end of the file, program stops. It's not specified what happens when you jump below the instruction 0.
` cannot access cells with addresses that aren't specified literally in the program (or the initial state of the tape), and cannot set cells to values that aren't specified literally in the program (or the initial state of the tape). As such, assuming that the initial tape contains only finitely many different values, ` is a finite-state machine.
0`+72 0`+101 0`+108 0`+108 0`+44 0`+32 0`+70 0`+119 0`+111 0`+114 0`+108 0`+100 0`+33
#Assuming cell one and two have the inputs. 1`1 +0`+5 2`2 +0`+3 0`+48 +48`+2 0`+49