User:Squidmanescape

Hello! I am Squidmanescape!

My Languages

I Implemented Them

• (top, height) - x-coord is top value of stack, y-coord is height of stack (Version 0.1.1 stably complete, Version 0.1.2 theoretical)
• 2Deadfish - two-dimensional Deadfish (most recent version stably complete)
• 2DFIM - minimal two-dimensional Brainfuck derivative. Is it Turing-complete? Who knows. (most recent version stably complete)

I Probably Could Implement Them

• (x-coord, y-coord) - family of two dimensional languages without directionality, finite-state automata at least, may never be Turing complete
  • (bottom, height) - x-coord is bottom value, y-coord is height of ???
  • double (top, height) - similar to (top, height) but functionally different
• 1r - a 3-dimensional language based on 2L and also sort of 1L_AOI
• Danicb - the Turing-complete language which is represented by the letter f and space (probably completable given spec)
• Dsii - Deadfish "self-interpreter" interpreter, meaning it can interpret Deadfish and Deadfish "self-interpreter"
• Haczyk - the variables trade the characters in the unordered dicts they necessarily contain, trying to find the letters in their names (2nd-most recent version stably complete, most recent version theoretical)
• Leetlang - a language which acts on values by way of exclusively Leetcode problems
• Minitree - family of small languages where the code is a tree and the tape is a tree (Version 1 and 2 stably complete, Version 3 theoretical)
• Morshu - Turing-complete language based on Morshu's dialogue with brain-dead "multithreading" based on deterministic execution of race-condition-type situations (stable, not proven to be Turing-complete, even though it probably is)
• Plutonium - language where values and operations mutate as though being affected by gamma rays (not stable, probably not Turing-complete)
• Supervised P with Printing - language which specifies code and output where the interpreter is a machine learning algorithm which is trained on these things (total and probabilistic version of a theoretical Turing-complete language)
• Surprised look - strongly-typed, tree-based Thue-like language which is arguably none of those things (stable, not proven to be Turing-complete even though it probably is)
• TritBitJump - a language based on BitBitJump which changes bits at arbitrarily large addresses (stable, not proven to be Turing-complete)
• WCTVCUO - a language which combines Unlambda with string-rewriting to make it... less powerful? (unstable, not proven to be non-Turing-complete even though it's probably not)
• Xwy / Xyw - a language loosely based on New which aims to be Turing-complete by starting from the strangest commands in that language (unstable, probably not currently Turing-complete)

I Don't Know How to Implement Them or They Aren't Done

• Branchback - the language which executes in a tree-based way
• Capitalsim - some of the variables have to pay the other variables to access their data
• Chma - family of uncomputable languages which are specified such that P = EXPTIME-complete (Version 1 stably complete)
• Meyerand - language which listens to Bertrand Meyer's ideas about break and continue keywords and has no explicit return keyword for a similar reason
• Pathana - language which is like Malbolge but 17-based
• StatiC - C-like language but without the ability to allocate and deallocate memory

Facts:

• 17 ^ 17 = 827240261886336764177

Special Pages

Interpreters in Gray Snail

Unimplemented by Date