Seas

Seas is a 2D esoteric programming language made by User:AmNow and was made for TeamSeas.

Commands

The memory field is an infinite sea with the instruction pointer at 0,0 and moves rightward.

🌊🌊🌊🌊
🔳🟦🟦🟦
🟦🟦🟦🟦

Everything outside of a written program is initialized with a space or a random character from the printable ASCII range with a ⅕ chance. Program execution ends when the instruction pointer reaches the top of the sea. Every line must be the length of the first one. The first line can only have 🌊 (whitespace not allowed).

🟦 - NOP.
🌊 - Ends the program, this can only be at the first line.
0️⃣ through 9️⃣ - Push the corresponding digit to the stack.
🅿️ - Pop the top two values on the stack and locate the coordinates in the sea and swap it with the accumulator.
🧾 - Swap the top of the stack with the accumulator.
🌡 - Set the accumulator to 0.
🔑 - Clear the entire stack.
🖍 - Reverse the stack.
📗 - Move the bottom-most element up to the top.
📙 - Move the top element to the bottom.
🖋✒️ - Mirrors.
📍 - Pop the top value of the stack, if it is 0, move up, otherwise move down.
📏 - Pop the top value of the stack, if it is 0, move left, otherwise move right.
➕➖✖️➗ - Add, Subtract, Multiply and divide on the stack.
🔼🔽◀️▶️ - Rotate the instruction pointer to match which way it is facing.
💡- Input a number and push it.
📖 - Input a Unicode Character and push it.
🗳 - Pop the top value and output as a number.
📅 - Pop the top value and output as a Unicode Character.
✉️ - Pop and discard.
✂️ - Swap.
🧻 - Duplicate.
🥤 - Logical NOT the top of the stack.

Programs

Truth-Machine

🌊🌊🌊🌊🌊🌊🌊
💡🔽🗳🟦🟦🟦🟦
🟦▶️📍🟦🟦🟦🟦 
🟦🟦▶️1️⃣🗳1️⃣◀️

Computational class

Seas can be proven to be Turing-complete by reduction from Reversible StackBit with only 10 instructions and no accumulator (arrows could be replaced by mirrors reducing it by 2 but for simplicity arrows will be used): 🌊🟦0️⃣1️⃣📍🖍🔽🔼🔽◀️▶️

0 is:

🌊
0️⃣
🟦
🟦

1 is:

🌊
1️⃣
🟦
🟦

~ is:

🌊
🖍
🟦
🟦

* is:

🌊🌊🌊
🔽▶️▶️
▶️📍🟦
🟦▶️🔼
🟦🟦🟦

[abc] is:

🌊🌊🌊...🌊🌊🌊
🔽▶️▶️abc🔽▶️▶️
▶️📍🟦...▶️📍🟦
🟦▶️🟦...🟦🟦🔼
🟦🟦🔼...🟦◀️🟦

There should be n amount of empty lines between  third and fourth lines based on amount of nested loop times 2 inside, each time a nested loop occurs this amount is reduced by two.