User:waffelz

“  54. Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy. ”

hello!

i'm waffelz, and i'm 15

i have a couple of esolangs on here

by the way, my name is supposed to be lowercase

my esolangs:

81

a turing-complete language that operates on a memory tape, where everything is in base 81! its syntax is similar to assembly
i actually wrote 81 in class because i was bored and didn't want to do my work :/
the article

BFASM

MY PROUDEST CREATION.

BFASM compiles to FULLY-FUNCTIONAL brainfuck, yet is still easy to code in! (at least compared to brainfuck)
(i'm still working on proving that it is equal in power to a finite-state automaton ☹)

it has an implementation in C++ at https://github.com/waffelz0/BFASM

Tea

i called this language Tea because i really like tea

it's turing complete, and it operates on two stacks

it has no input and the "output" is the final state of the stacks

you input stuff by editing the program, kinda like Underload

it has a python interpreter, though it can get REALLY slow

miscellaneous examples i've made in it, sorted by length:

*(+)
:*(!1)
0{*(:*(}+{))!}
::*(!1)1%*(-):{*(!1)}1%*(-)*(::{*(:-)!}-*(0{*(:*(}+{))!}))

_{note: at the time of originally writing this i was eating gummy bears 😋}