TLQ

TLQ is an esolang created by User:Yayimhere, after being disappointed at Infinite Goto's execution of its concept. TLQ is quite similar to a Minsky machine. It is inspired by I/D machine, Minsky Swap, and Karvity.

Etymology

TLQ's name is an acronym for "The Last Question", named after the story by Issac Asimov. In the story, an AI tries to reverse entropy. TLQ however, is quite the entropic language writing wise, as it is just a random list of numbers and spaces. and as such, it has gotten its name.

Memory

Memory is stored in two unbounded registers. There is a pointer, pointing to one of the two at all times. Every four iterations of the program, the pointer switches between which register is being pointed too. The first register pointed to starts at 10, and the other starts at 0. On every iteration, after a command has been ran, the register not pointed to increments, and the one pointed to decrements. If the currently pointed to register is decremented to below zero, the value is reset, and makes the increment go up by 2 instead of 1, as well as going back to the start of the program.

Syntax

A program is made up of an unbounded number of lines, each either a space, or a nonnegative integer written in base 10. This integer can be of any length, but may not start with 0 unless that is the only symbol. Lines are indexed starting at 0

Semantics

For any line with an integer, it does a GOTO, to the line with that integer as its index. This will also increment the current counter by 2, which because of the constant decrement is only an increment by 1. If a line is blank, it does a NOP. However if a decrement on 0 happens while a NOP is being ran, the program will GOTO the start of the program, decrementing the register not being pointed to. The program halts when an out of bounds GOTO happens, or when the program pointer reaches the end of the program.

Computational class

As of currently, TLQ's computational class is unknown. However, it must be more powerful than a push-down automaton as it can implement a looping counter with the following code, in which you can look at the second counter(the one that starts at 0) to see the current value:

1
0

as such, it is most likely turing complete, as it is quite similar to a minsky machine.