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.
OΔTS
Jump to navigation
Jump to search
- Not to be confused with Oats.
OΔTS(pronounced OATS) is a esolang created by User:Yayimhere
memory
memory is a stack holding floats.
commands
| command | meaning |
|---|---|
W(n) |
pop the top of the stack and push the first digit of it mod n. if the digit is 0 push 1 unless n=10
|
[...] |
loop ... while top of stack is not 0
|
<(n) |
pop top of stack. if its equal to n then push 1 else push 0
|
" |
duplicate top of stack |
Q(n) |
goto line n
|
{n} |
push n
|
! |
pop top of stack |
~(n) |
pop top two values of stack(first popped is A, and second popped is B) then do then take the digital root of that and push the result. if B is 0 however, A will be multiplied by n and then push the result
|
; |
move top of stack to the bottom |
= |
swap top two values of the stack |
| |
negate top of stack |
? |
pop the two top elements of the stack and a add them together with the first popped being on the left side of the operator |
Computational class
OΔTS is Turing-complete as it can simulate Brainfuck with while finite amount of unbounded cells using 10 characters, 01{}[]-?=;:
- Code starts with
{0}repeated times the amount of cells >is;, as tape is wrapping<isn't needed and is replaced by;repeated amount of times equal to length of a tape minus 1+is{1}?-->{-1}=?[...]remains the same
It could be shortened to 9 by translating - as ;{-1} followed by ; repeated times amount of cells and after that ? is put.
qoob / Quinary Bueue can also be translated into it with only 8 characters, 01{}[]!;:
0becomes{0};1becomes{1};[...]becomes[!...]!