All public logs

Combined display of all available logs of Esolang. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

10:51, 30 November 2024 ChuckEsoteric08 talk contribs created page Talk:Spain without the S (Added Unfinished proof)
08:39, 23 November 2024 ChuckEsoteric08 talk contribs created page 8 bits, 256 bytes (Created page with "'''8 bits, 256 bytes''' is an esolang by User:ChuckEsoteric08 inspired by Chip-8 ==Description== It has 8-bit Program Counter, allowing programs to have 256 bytes at most, it has 16 8-bit internal registers, R0-RF, last one used only as a flag for other instructions, and a 8-bit Stack Pointer for the call stack. Program uses the same store for both program and data. There is also a 64x64 screen and a 16-key keyboard similar to Chip-8. Sprites are encoded as a series...")
15:22, 18 November 2024 ChuckEsoteric08 talk contribs created page Halforth (Created page with "'''Halforth''' - is an esolang based on Forth by User:ChuckEsoteric08 in which every insyruction takes half of a byte (a single hexadecimal digit) ==Description== Language works on a stack as well as a tape to store data, which could contain both negative and positive integers {| class="wikitable" |+ Commands (in hex) |- ! Command !! Opcode !! Description |- | 0-9 || push x || Push a single digit to the stack |- | A || op || pop operation, a and b and perform b<op>a...")
10:40, 2 November 2024 ChuckEsoteric08 talk contribs created page ChuckEsoteric08/Interpreters (Redirected page to User:ChuckEsoteric08/Interpreters) Tag: New redirect
13:25, 1 November 2024 ChuckEsoteric08 talk contribs created page Inpro (Redirected page to InPro) Tag: New redirect
13:24, 1 November 2024 ChuckEsoteric08 talk contribs created page InPro (Created page with "'''InPro''' ('''In'''finite '''Pro'''gram) is a brainfuck derivative by User:ChuckEsoteric08 ==Description== The programs in the language are infinite, and thus it it needs to be run using a REPL. In this version while loop <code>[...]</code> is instead an if statement, which runs the code inside only if the cell is not 0. It would also make it easier to implement rather than normal brainfuck. ==Computational class== We can execute same program over and over aga...")
12:11, 30 October 2024 ChuckEsoteric08 talk contribs moved page Stakc to Stakc/Old
11:40, 30 October 2024 ChuckEsoteric08 talk contribs created page Sucks (Created page with "'''Sucks''' is a derivative of Suc by User:ChuckEsoteric08 ==Description== It's syntax is very similar to Suc, but with following additions: IN x Would input a number and store it in register x CIN x Would input byte x and store it's value in reigster x OUT x Ouptput register x as a number, unlike in Suc it's not an optional command COUT x Output reigster x as a character *x Would replace argument with value of register x, but it can't replace a line number...")
14:53, 12 October 2024 ChuckEsoteric08 talk contribs created page Talk:Around and around, sleeping sound (Computational class: new section)
08:50, 5 October 2024 ChuckEsoteric08 talk contribs created page OR (Created page with "'''OR''' ('''O'''ne '''R'''egister) is an esolang by User:ChuckEsoteric08 derived from 1-register Minsky machine ==Specification== A language has a single register, initialised to one, and a constant, initialised to 0 {| class="wikitable" |+ Commands |- ! Command !! Description |- | <code>></code> || set constant to the amount of <code>></code>'s. Example <code>>>></code> sets the constant to 3 |- | <code>*</code> || Multiply register by a constant |- | <code>/x</cod...")
08:34, 29 September 2024 ChuckEsoteric08 talk contribs created page Beatnik Extended (Created page with "{{Stub}} '''Beatnik Extended''' is two seperate Turing complete extensions of Beatnik created by User:ChuckEsoteric08 ==Additions== ===Infinite Beatnik=== This version is only different from Beatnik by having unbounded non-negative integers instead of bytes on a stack. This version is Turing complete by reducing Portable Minsky Machine Notation into it ===Reversing Beatnik=== It adds additional opcode 18 - reverse the stack The language is Turing complet...")
07:50, 29 September 2024 ChuckEsoteric08 talk contribs created page S*bleq (Created page with "'''S*bleq''' is a derivative of Subleq by User:ChuckEsoteric08 ==Differences== Now the command a b c Would subtract memory address <code>b</code> from memory address <code>a</code>, storing result in later, and then go to memory address <code>mem[c]</code> ===Special addresses, none of which could be in <code>c</code>=== -1 IP -2 returns next byte of user input -3 outputs value of another address ===Variations=== ====S*bl*q==== In this version the result of s...")
08:30, 21 September 2024 ChuckEsoteric08 talk contribs created page TDML (Created page with "'''TDML''' ('''T'''wo '''D'''imensional '''M'''inimalistic '''L'''anguage) is an Turning tarpit by User:ChuckEsoteric08 inspired by 2L and 1L. It also is a languge where many commands can function differently in various implementations ==Specification== TDML is a cell-based two-dimensional language with has four commands: <code>+</code>, <code>*</code>, <code>?</code> and NOP, which can be represented as any other character. The tape is binary and infini...")
14:29, 7 September 2024 ChuckEsoteric08 talk contribs created page *bfuck (Created page with "'''*bfuck''' is an esolang by User:ChuckEsoteric08 based on brainfuck ==Commands== The tape has infinite amount of unsigned unbounded integers +-,.[] Are the same, <code><></code> are removed and there is additional command | Which toggles between two states: in one of them commands function on the first cell, which is default one; and second one, in which the cell which is the cell which first cell points to, so if first cell value is 0 it will modify the firs...")
11:21, 4 January 2024 ChuckEsoteric08 talk contribs created page SHITS (Created page with "'''SHITS''' ('''S'''imple language wit'''H''' b'''ITS''') is an esolang by User:ChuckEsoteric08 based on brainfuck minimalisations which uses binary tape. ==Speceification== Language uses right-infinite tape. ==Commands== ! - flip bit and move to the first cell > - move right {...} - while not zero Optional I/O commands: * - output bit + - input bit ==Computational class== Language is Turing-complete, because it can simulate Cyclic Tag with initial string of 1:...")
08:26, 4 January 2024 ChuckEsoteric08 talk contribs created page Two variable language (Created page with "'''Two variable language''' is an esolang by User:ChuckEsoteric08 based on B2C. ==Specification== Language works on two variables, a and b, which store unsigned integers. Initially, a is set to 0 and b is set to 1 ===Commands== Pointer starts at variable a + - add values of current variable and other variable, store result in current variable - - subtract value of current variable from other variable, store result in current variable. If result is less than 0,...")
09:25, 3 January 2024 ChuckEsoteric08 talk contribs created page Quinary Bueue (Created page with "'''Quinary Bueue''' is an esolang by User:ChuckEsoteric08. ==Specifcation== 0 - enqueue 0 1 - enqueue 1 [ - dequeue, if zero jump after matching ] ] - jump back to matching [ ==Computational class== '''Quinary Bueue''' is Turing-complete because it can simulate brainfuck with fixed amount of unbounded cells. First we should translate brainfuck into a version with wrapping tape. Then we translate it into '''Quinary Bueue''' like that: Create new cell: 0 <code>><...")
09:16, 30 December 2023 ChuckEsoteric08 talk contribs created page ASCIIfuck (Created page with "'''ASCIIfuck''' is a variation of brainfuck by User:ChuckEsoteric08 which uses ASCII values of a characters. ==Specification== brainfuck is encoded as follows: *Take ASCII value of character *If it has three digits, add first two *First digit of an operation represents brainfuck command like that: **1 is + **2 is - **3 is > **4 is < **5 is , **6 is . **7 is [ **8 is ] **Anything is invalid *Second represents how many times command is repeated. ==Examples== ===Cat===...")
12:08, 23 December 2023 ChuckEsoteric08 talk contribs created page Binary-encoded Minsky machine (Created page with "'''Binary-encoded Minsky machine''' (BMM) is a version of Minsky machine by User:ChuckEsoteric08 ==Encoding== This version is based on a version of Minsky machine with instructions INC and JZDEC, along with I/O instructions, where INP sets register to ASCII value of input and OUT outputs register as a character with unlimited amount of registers. Indexes start at 1. They are encoded like that: INC r - 110r0 JZDEC r z - 10r011z INP r - 100r OUT r - 00r <nowiki>*r...")
13:56, 20 December 2023 ChuckEsoteric08 talk contribs created page LargeFish (Created page with "'''LargeFish''' is an esolang by User:ChuckEsoteric08 based on BigFish, which is itself based on Deadfish ==Specification== '''LargeFish''' operates on infinite amount of registers whixh store nonnegative integers. It has the following commands: i x - increment x d x - decrement x s x - square x o - output x e x y - set x to y loop x - loop x times endloop - end loop Note that if you put an asterisk before y in e, or before x in loop it would return va...")
16:01, 17 December 2023 ChuckEsoteric08 talk contribs created page PushDupAddSub (Created page with "'''PushDupAddSub''' (PDAS) is an esolang by User:ChuckEsoteric08 inspired by Volatile ==Commands== 1 - push 1 + - pop a and b, push a+b - - pop a and b, push b-a / - pop a and b, push b/a followed by remainder : - duplicate [...] - while 0 ==Computational class== PDAS is Turing-conplete becaue PMMN-like language to it: n should be prime number. P(n) would push n, when compiled to normal it uses 1, + and : Initialisati...")
17:09, 10 December 2023 ChuckEsoteric08 talk contribs created page IncCa (Created page with "{{Stub}} '''IncCa''' ('''Inc'''rement and jump if '''Ca'''rry)- is an OISC by User:ChuckEsoteric08 that is easy to implement ==Specification== '''IncCa''' runs on Self-Modifying Virtual Machine with width of an address and a IP (which are equal) being 8, 16, 32 or 64 and one instruction a b Meaning "Increment address a and if it overflows jump to address b". Program halts if IP overflows Category:Languages Category:OISC Category:Bounded-storage machine...")
07:31, 9 December 2023 ChuckEsoteric08 talk contribs created page Unary Stack (Created page with "'''Unary Stack''' is a attempt at creating syntax for 1-symbol Push-down automaton by User:ChuckEsoteric08 ==Syntax== Each state is represented like that: s1: commands s2 (s3) Where s1 is the current state, followed by commands, next state, and if last command was -, followed by s3. It will then execute commabds and if stack is empty current state s3, else s2 ===Commands=== + - push 1 - - pop . - output length of the stack , - input number, and set length of...")
07:16, 9 December 2023 ChuckEsoteric08 talk contribs created page Talk:Beta (Created page with "Both decrement and NOT command use ! character. Is it intentional?--~~~~")
11:17, 8 December 2023 ChuckEsoteric08 talk contribs created page RightSlash (Created page with "'''RightSlash''' is esolang by User:ChuckEsoteric08 with left-infinite tape with cells with values 0-F. User:ChuckEsoteric08 forgot to save .txt file so not much specification is known. What is known that it has no increment/decrement commands, it used characters > and \ and only control flow statement is jump if not equal. ==Brainfuck interpreter== Uses right-infinte tape and 8-bit nonwrapping cells Program seperated from input by a space >\>\>>>>>\\\\\\\\\...")
16:29, 1 December 2023 ChuckEsoteric08 talk contribs created page Quell (Created page with "'''Quell''' ('''Que'''ue ca'''ll''') - is an esolang by User:ChuckEsoteric08. ==Specification== Quell uses infinte tape which can hold unbounded values. It also uses Call Queue for subroutines. <code>*x</code> returns value in cell x ===Commands=== SET x y - set cell x to y ADD x y - add cell x and cell y and store in x SUB x y - subtract cell y from cell x and store in x JMP x - jump to subroutine x JNZ x y - if cell x is not zero jump to subroutine y J...")
12:11, 1 December 2023 ChuckEsoteric08 talk contribs created page Dat is Dis (Created page with "{{Stub}} '''Dat is Dis''' - is a version of Dis created by User:ChuckEsoteric08 which has infinite memory. ==Changes== Now each address contains unbounded amount if trits, all of which are initially 0. Each conmand would only access a finite amount of trits, number of which is diffirent for each interpreter. After every fifth instruction is executed, the amount of trits is then multiplied by 15 Category:Languages Category:Unknown computational class Ca...")
15:38, 30 November 2023 ChuckEsoteric08 talk contribs moved page Mountain to Mountain/Old
17:03, 19 November 2023 ChuckEsoteric08 talk contribs created page Incrementing machine (Created page with "'''Incrementing machine''' is a variation of Minsky machine discovered by User:ChuckEsoteric08. Unlike any other counter machines it can only increment registers, but not decrementing or setting them to 0. It was discovered while author was working on Turing-completness proof for AddJump ==Specification== '''Incrementing machine''' uses unbounded amount of registers as memory which are numerated with the first register being 0, second being 1 and so on. All of th...")
10:36, 19 November 2023 ChuckEsoteric08 talk contribs created page ʟɐä̯ɴɢʁɥɪɖʐ (Created page with "'''ʟɐä̯ɴɢʁɥɪɖʐ''' is a programming language invented by User:ChuckEsoteric08 inspired by Quiney. ==Specification== It uses infinite array of symbols as memory. It also uses two registers which point to symbols, Interpreter Pointer (IP) and Cell Pointer (CP). IP and CP begin in the same place and moving right. both IP and CP moves to the next instruction in their own dolirectionafter command has been executed. Both can have two directions: right and lef...")
14:52, 18 November 2023 ChuckEsoteric08 talk contribs created page Brainjump (Created page with "'''brainjump''' is an esolang by User:ChuckEsoteric08 which was created in March of 2022 but published only in November of 2023 ==Specification== brainjump uses right-infinite tape which stores unbounded integers as memory. ==Commands== > - move right and increment cell - - decrement cell < - move left ^ - if current cell is not zero go back to the start of a program ! - go back to the start of a program ==Computational class== Author thinks that the language is...")
12:15, 18 November 2023 ChuckEsoteric08 talk contribs created page SBFM (Created page with "'''SBFM''' (Strange brainfuck minimalizations) are brainfuck minimalizations created by User:ChuckEsoteric08 ==Notes== Note that in all of them loops are only run if they are not empty ==SMBFM-1== > - move pointer right { - flip bit and start while not zero loop } - end while not zero loop and move pointer left 1-bit brainfuck to SBFM-1: BF SMBFM-1 -- ------- > > * {}> < {}>{} [ {}>{ ] }{}>{} Category:Languages Category:Brainfuck de...")
15:49, 11 November 2023 ChuckEsoteric08 talk contribs created page Quebe (Created page with "Quebe ('''Que'''ue of '''B'''yt'''e'''s) is an esolang which is inspired by ResPlicate by User:ChuckEsoteric08 ==Description== Quebe uses a queue made out of bytes and has initial state which is an nonempty string. ===Execution=== At each step, a symbol is dequeued (let's call it <code>x</code>) and enqueue string starting at the front a queue to <code>n</code>, where <code>n</code> is how many times <code>x</code> appears in the queue after it was dequeued. If...")
13:44, 15 September 2023 ChuckEsoteric08 talk contribs created page Talk:KnightJump (Created page with "Holy hell--~~~~")
10:51, 9 June 2023 ChuckEsoteric08 talk contribs created page Brainfuck with while 0 loops (Created page with "This page is proof that brainfuck with unbounded tape and cells and while 0 loops is Turing complete. Which is proven by simulation of Cyclic Tag: ==Initialise data== put <code>+>></code> at the start of a program then initialise program with <code>0</code> being <code>>+></code> and <code>1</code> being <code>>></code>. After initialising data append <code>>+<<[<<]>>[</code> ==Simulating Cyclic Tag== Replace every <code>;</code> with <code>+>></code>, <code>0</code> wit...")
10:16, 7 June 2023 ChuckEsoteric08 talk contribs created page BSQBL (Created page with "'''BSQBL'''('''B'''rainfuck '''S'''tyle '''Q'''ueue-'''B'''ased '''L'''anguage) is an esolang by User:ChuckEsoteric08 ==Specification== > - enqueue zero + - dequeue, increment and enqueue - - like - but decrement < - dequeue and enqueue " - dequeue and enqueue 2 times , - enqueue user input . - dequeue and output [ - dequeue and if zero jump to matching ] ] - jump to matching [ ==Examples== ===Cat=== ,"[.,"] ===Output "H"=== >+++++++"<[-+<+<+<+<+<+<+<+<+<+...")
14:08, 30 May 2023 ChuckEsoteric08 talk contribs created page Extension (Created page with "'''Extension''' is an esolang(s) by User:ChuckEsoteric08 to make FakeScript Turing-complete with as small additions as possible ==Specification== ===Version 1=== !label and goto commands were deleted. Variables a-z were added and #x would return value of variable x if [arg1] [arg2] If [arg1] [arg2] are equal would execute code between this command and matching endif input [arg1] Would set variable [arg1] to to user input set [arg1] Would concatenate every outp...")
10:06, 30 May 2023 ChuckEsoteric08 talk contribs created page Llec (Created page with "{{Stub}} '''llec''' is an esolang by User:ChuckEsoteric09. ==Specification== '''lecc'' operates on a tape of unbounded integers. *x would reference cell x. Cells are 0-indexed. There are 8 commands: +x - increment cell x -x - decrement cell x "x+y - increment cell x by the value of cell y, store result in cell x /x - declare label x \x - goto label x ?x=y - if cell x is y, skip next command 'x - set cell x to next byte of user input :x - output cell x as ASCI...")
09:26, 28 May 2023 ChuckEsoteric08 talk contribs created page MM1char (Created page with "'''MM1char''' is description of 2-register Minsky machine with instructions: INC, DEC, JZ. It's goal is same as for StackBit: to be easily implementable. ==Syntax== + - increment register 1 - - decrement register 1 * - increment register 2 / - decrement register 2 [abc] - declare label abc (abc) - goto label abc ~ - if register 1 is zero skip next command ` - if register 2 is zero skip next command Category:Languages Category:Turing complete Catego...")
14:49, 27 May 2023 ChuckEsoteric08 talk contribs created page A Queue which can't grow (Created page with "'''A Queue which can't grow''' is an esolang by User:ChuckEsoteric08. ==Specification== '''A Queue which can't grow''' uses a queue of integers to store data. Its initial state is set to user input with elements being seperated by ; There are only two (three counting \ which is a nop) commands: | Which dequeues element, increments it, and enqueues result / Which dequeues element, If it's nonzero decrements it, and enqueues result. If it's zero it would enqueue z...")
16:30, 26 May 2023 ChuckEsoteric08 talk contribs created page Suc (Created page with "'''Suc''' is an esolang by User:ChuckEsoteric08 based on a Succesor machine ==Specification== '''Suc''' uses unbounded amount of registers to store values. Line numbers are 0-indexed. There are only three commands: INC x y Increment register x by y. CLR x Set register x to zero. JEQ x y z If registers x and y are equal goto line z. There is also optional command which is used for debuging: OUT x Which outputs value of register x. And thats it! Now try do to...")
15:39, 26 May 2023 ChuckEsoteric08 talk contribs created page Talk:Sreg (Created page with "==Self-interpreter== I think that it's possible to write self-interpreter. You can encode registers as a tape with 6 cells. Implementing the tape is not that hard you can store it in A as a binary value <code>1a0b0c0e0f</code> where a, b, c, e, and f are cells. Their number is represented as string of 1's. Using B and C you could move tape around. Implementing <code>++ A B C</code> is not that hard: Go to cell A, set it to 0, copy value of B to A, and increment A times t...")
08:41, 26 May 2023 ChuckEsoteric08 talk contribs created page SStack (Created page with "'''SStack''' ('''S'''even '''S'''tacks) is an esolang by User:ChuckEsoteric08 inspired by Kipple and was designed as more powerful version of Sreg. ==Commands== '''SStack''' uses seven stacks:a, b, c, d, e, f and g. If you try to accsess empty stack then it would return 0. Decrementing zero is a nop >x/y< - pop element from stack x and push it to stack y +x/y+ - pop element from stack x, increment it and push it to stack y -x/y- - like +x/y+ but decrement...")
11:53, 24 May 2023 ChuckEsoteric08 talk contribs created page Stack based (Created page with "'''Stack based''' is an esolang by User:ChuckEsoteric08 which is similiar to Queue based but it uses stack instead. ==Specificstion== '''Stack based''' uses three stacks as memory: a, b and c push x y Push x to stack y pop x Pop from stack x move x y Pop element from stack x and push it to stack y inp x Push input to stack x out x Pop element from stack x and output that element lbl x Declare label x rep x y z Similiar to [abc_xyz] in Queue based. Replace...")
15:59, 23 May 2023 ChuckEsoteric08 talk contribs created page Queue based (Created page with "'''Queue based''' is an esolang by User:ChuckEsoteric08. The name does not only implies that it stores data in queues but also means that using Queue is based. It's main inspirations were Underload and Smurf ==Specification== '''Queue based''' stores data in two queues. When you go to nonexisting label or try to dequeue if queue is empty program will halt (abc) - enqueue string abc , - dequeue @ declare new label ; - switch to diffirent queue ' - dequeue...")
10:56, 23 May 2023 ChuckEsoteric08 talk contribs created page Number-encoded Bitwise Cyclic Tag (Created page with "'''Number-encoded Bitwise Cyclic Tag''' is variant of Bitwise Cyclic Tag by User:ChuckEsoteric08 which was created to implement BCT in register-based languages like TLIJMMWTRAMCBICHWTPITCSIBCTII, Sreg or EsoBASIC. ==How it works== To convert Bitwise Cyclic Tag to Number-encoded Bitwise Cyclic Tag you should do this 2 (or 3) steps: # Reverse Program and Data strings # Append 1 to the beginning of each string # (only for BCT-in-Sreg and WIP BCT-in-EsoBA...")
07:39, 23 May 2023 ChuckEsoteric08 talk contribs created page ABCstr (Created page with "'''ABCstr''' is an esolang by User:ChuckEsoteric08 ==Specification== '''ABCstr''' uses string as memory. Initial string is "abc". There are three commands: x=y If there is instance of x in the string replace it with y, else goto label x x-y Works the same but also outputs x if there is x :x Works the same but will replace with user input. It is the only string-rewriting language created by User:ChuckEsoteric08 that has input ==Examples== ===Hello, World!===...")
17:04, 21 May 2023 ChuckEsoteric08 talk contribs created page StackBit (Created page with "'''StackBit''' is a Turing-complete esolang by User:ChuckEsoteric08 that is easy to implement. ==Specification== Data is stored in two stacks. 0 - push 0 to the current stack 1 - push 1 to the current stack ~ - switch to another stack [...] - while top of the stack is 1 * - pop top element There is also optional command for debuging: . - outputs top of the stack ==StackBit minimalisation== We could minimise number of instruction by combining ~ and 0 into co...")
11:48, 19 May 2023 ChuckEsoteric08 talk contribs created page NASAL (Created page with "'''NASAL''' is an esolang by User:ChuckEsoteric08. ==Specification== '''NASAL''' uses stack as memory. If program contains invalid character it's an error. {| class="wikitable" |- ! Command !! Function |- | <code>mx</code> || push <code>x</code> to the stack |- | <code>ɱ</code> || pop and discard |- | <code>ɳx</code> || while top!=<code>x</code> |- | <code>ɲ</code> || end while |- | <code>ŋ</code> || move element from top to bottom |- | <code>ɴ</code> || move el...")
10:23, 17 May 2023 ChuckEsoteric08 talk contribs created page NABC (Created page with "'''NABC''' is an esolang by User:ChuckEsoteric08 in which command is defined by number of a, b and c. ==Specification== d is used to seperate commands. Data is stored in Accumulator and stack. Line numbers are 0-indexed. <code>n(x)</code> means "number of symbol X". {| class="wikitable" |- ! Name || Number of A || Number of B || Number of C !! Meaning |- | inc x || 1 || 2 || x || Increment Accumulator by n(c) |- | dec x || 1 || 2 || x || Decrement Accumulator by n...")

All public logs

Navigation menu

Search