User:ChuckEsoteric08
Jump to navigation
Jump to search
-[------->+<]>--.[--->+<]>++..--------.+++++.-------.--[--->+<]>-.+[->+++<]>++.+++++++++.-[->+++++<]>-.[-->+++++++<]>.[----->++<]>+.--[--->+<]>--..++[->+++<]>++.+++++++++++++.++++++.
Hello! I am creator of Scratch studio for Esoteric programming languages and I love Esointerpreters! You can see some of them. here.
Things I made
Languages(In Chronological order)
2021
2022
- Binin and Binin++
- Kak and its derivates
- Number2D
- Inputbrain
- Mountain
- 2DChanger
- Idego
- FJZ
- IDlang
- BitBrain
- REALScript
- Xaxa
- Quests
- Force of Arch
- Poppingbrain
- Miw
- UBLANG
- ALWCIDFEC
- Schwa
- Counter minus
- Okayako
- BrainWrite
- Voiced dental fricative
- BackStart
- Inputfish
- Tapelang
- SetGoto
- DIACRITIC
- Toki pona li pona
- Cool Cell
- Lag
- Stakc
- AddJump
- Smaller
- Cipher
- ATSML
- LECHEI
- 1BNWL
- At some land
- LRL
2023
- Too
- Duck
- Tueue
- Selfie
- InputSet
- INJUQ
- SUBBIG
- TLIJMMWTRAMCBICHWTPITCSIBCTII
- Sreg
- VarStack
- GotoStart
- Uppercase=Lowercase
- Redefine Symbol
- RIfP
- SQD
- @!+-()
- Decleq
- SSREPL
- TailDot
- ASRL?
- CDILOI
- TACC
- Let's Rewrite String!
- NABC
- NASAL
- StackBit
- ABCstr
- Queue based
- Stack based
- SStack
- Suc
- A Queue which can't grow
- MM1char
- llec
- Extension
- BSQBL
Compilers
- sf2wikitable - smallfk to wiki table compiler.
Data Structures
Turing-completness Proofs
- Universal Turing-completness Proof
- BitFlip
- Uyjhmn n
- ◀◀SYNTHESIZE▶▶
- Brainspin
- EsoBASIC
- Brainfuck with while 0 loops
Interpreters for languages I didn't create
- Nope. interpreter in:
- Batch
- GolfScript
- Hello derivates:
- REALScript
- ///
- +-
- REALScript++
- Bitwise Cyclic Tag
- I/D machine
- Weeeeeeeeeeeeeeeeeeeeeeeeeeeeee
Things that I like and don't like
Things that I like
- Computational class:Turing complete or Push-down automata
- Finite state automaton that can simulate arbitrary Finite state machine(like BackFlip)
- Long acronyms(like The Multi-Million Language Project To End All Language Projects And Isn't That A Fine Name For A Language)
- Esointerpreters
- When i win in chess(chance of it is 0.0001% or less)
- Turing tarpits
Things I don't like
- Computational class:Total(Why does it exist if there is Finite state automaton or Push down automaton?)
TODO list
- I might make interpereter for Brainfuck, Bitwise Cyclic Tag, Smallfuck and 1BNWL in VarStack
- Create Bitwise Cyclic Tag interpreter in Duck
- Create Deadfish interpreter in Selfie, Tueue, Duck and VarStack
My Ideas for esolangs
Self-Modifying goto and if
Using one/two self-modifying instruction(s) for making loops and if statements
Self-Modifying language(SMlang)
Turing-complete language that uses only commands for swaping instructions and adding new commands while interpreting commands. It need to use program as memory that can be changed.