User talk:Dichrone91

Hello! I'm Dichrone91 and this is my Esolang talk page! I enjoy esolangs and have created a couple ideas myself, though right now they're not full-fledged; for that, I would want them to at least be Turing complete. I also enjoy conlangs, notably Toki Pona, and my favorite subjects are math, art, and music.

I am open to criticism, IF it's just a typo or grammar error. I WILL fight you in the comments if you say that my work is bad.

Opener

Note: This is my opening post for my talk page. Under no circumstance should you remove it!

Alright, as the opener, let's start with a puzzle: I dare you to make a Whitespace program which outputs how many characters it contains (including comments).

This is a step up from just a Quine; I'll call it a Dual-Level Quine; it needs to both be functional code and give you the amount of characters inside it.

Good luck. With that. Dichrone91 (talk) 19:20, 26 March 2026 (UTC)

One of the program ideas I came up with

First up: Sakupen. The way this one works is built with a BF/Python-esque, unbounded-stack mode of operation. You have an unbounded 1D array; this is your memory data. You also have a pointer on the middle cell of this array.

The commands are the following:

< and > move the pointer.

^ and v increment and decrement the value at the pointer.

X stores whatever value the pointer is on, or whatever has just been referenced.

O pastes the last data point in X into the cell the pointer is at.

D wipes the X-storage clean.

+, -, *, /, and % do what they do in Python-based languages: plus, minus, multiply, divide, and the modulo operation.

L interprets the array in text.

R repeats stuff.

Hello world:

^^^^^^^^>^^^^^>
R #2;
>^^^^^^^^^^^^
>^^^^^^^^^^^^^^^>>
^^^^^^^^^^^^^^^^^^^^^^^>^^^^^^^^^^^^^^^>^^^^^^^^^^^^^^^^^^>^^^^^^^^^^^^>^^^^L

Fibonacci sequence:

^X>^X>+DXO
R #c;
DX<X<+DX>>>O

where c can be any number