From Esolang
Jump to navigation Jump to search


Things I made

Languages(In Chronological order)

Data Structures

Turing-completness Proofs

Also i wanted to prove Turing-completness of OW-1, but someone did it when i was writing Proof for BitFlip and searching other languages to prove Turing-completness of.

Interpreters for languages I didn't create

  • Nope. interpreter in:
    • Batch
    • GolfScript
  • Hello derivates:
  • +-
    • REALScript++


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 add new while interpreting commands. It need to use program as memory that can be changed.