User:Gapples2
Jump to navigation
Jump to search
hi
I mainly spend my time on this wiki looking through Category:Unknown computational class and try to find esolangs that I can prove the computational class of (which is not many because I'm not too good at it).
Name | Computational Class | Notes |
---|---|---|
CV(N)(C) | Turing-complete | proof in talk page |
↑110010000100110110010 | Turing-complete | i didn't explain the proof very well |
Consequential | Turing-complete | |
Brainfunct | Turing-complete | |
Charred | Finite-state automaton | |
Queuenanimous | Turing-complete | |
UBLANG | Push-down automaton | |
Pit | Turing-complete | |
Lengthwise | Finite-state automaton | |
Spacefish | Turing-complete |
Name | Computational Class | Notes |
---|---|---|
()s | definitely Turing-complete | translation from PMMN |
(Macro\\c) | very likely Turing-complete | BCT interpreter |
.chat | probably Turing-complete | this esolang pretty much has identical instructions to BCT |
/path | definitely Turing-complete | probably simulate BCT |
2022 | definitely Turing-complete | simulate BCT |
6ix | probably Finite-state automaton | can only access memory mentioned in program |
99 bottles of pain | definitely Turing-complete | probably PMMN translation |
;;; | definitely Turing-complete | identical process to Brainfunct |
BrainCursion | likely Turing-complete | maybe translation from Brainfuck |
Campfire | maybe Turing-complete | needs a way to rejoin 2 branching paths |
MangularJS | definitely Turing-complete | can simulate an infinite tape |
MiniPig | definitely Turing-complete | simulate BCT |
Name | Notes |
---|---|
Bitflipper | terrible esolang that i made really fast back when i first became interested in esolangs |