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.

14

From Esolang
Jump to navigation Jump to search

14 is an esolang made by User:Marcus 2n2 because he likes esolangs named after numbers

Instructions

Symbol What they do
1 Pops a and pushes 10a+1. If stack is empty, push 1.
4 Pops a and pushes 10a+4. If stack is empty, push 4.
: Duplicates top of stack. If empty, push 0.
- Pops a and b, and pushes b-a. If there's only one element, negate. If the stack is empty, push 0.
/ Skips all instructions (except \) if top of stack is 0. if top of stack is empty, interpret as 0
\ Stop skipping instructions.
( No-op
) Go back to the matching (
i Push input.
u Pop.
o Output ascii.
O Output number.
> Rotate stack right.
< Rotate stack left.

Basic components

Push 0

::-

Input all

(i/)\

Infinite loop

()

Print a newline

::-1:>1<-o

Comments

::-/any comment can be stored here\u

Set element to 0

:-

Examples

Cat program

btw, this esolang has

(i/o)

A+B problem

>::-<--

Reverse cat

(i/)\(o/)

Truth-machine

4:4>-i>-(:O/)

Looping counter

41::-:1:>--<((:::-1-<:o>/)\u ::-1:>1<-o)

Hello

44:::-<::-14---::-1:>-<-o11:111::-1---:o::-:4:::>-<::-1----:oo111o

Turing completeness proof

14 is Turing-complete because it is able to simulate three cell Brainfuck. Every program must start with :::. The following table is applicable:

Proof
bf 14
, i
. o
< <
> >
[ /(
] /)\
- ::-1-
+ ::-:1--