95-98
95-98 is a esolang thats just... stupid. it was made by User:Yayimhere
name
the name comes from a wikipedia article where it said 95-98 somewhere. the name works as code an results in the list being equal to [6, 7]
memory
memory is stored in an unbounded list starting a 1 as the only element. if a number is negative there must be a ` after it
how it works
the command x-y will append all the numbers in range x to y, to the list(so for example 1-100 will add all the numbers from 1 to 100 excluding 1 and 100).
if x is more than y however it will delete the first element of the list.
if x and y are equal it will delete every non 0 number. if y is 0 and x is non 0 it will delete every number in the list thats not equal to x.
if x and y are both 0 it will do the following command if the first element of the list is not 0.
if x is not a number and y is 0 it will output the whole list as unicode chars.
if x is not a number it will add user input as a number to the list.
if y is not a number it will take user input as an unicode string(EOF) and add it to the list.
if x and y are not numbers it will add together the first two elements in the list.
and if, x and y are both equal, AND x and y are not numbers it will loop whats between it and the nearest copy until the list becomes empty
anything thats not a command will be ignored
tip
a simple way to add any number n is to do: (n-1)-(n+1)
examples
hello, world!:
103-105 100-102 107-109 107-109 110-112 43-45 31-33 118-120 110-112 113-115 107-109 99-101 32-34 A-0
A-A 41-43 A-0 A-A
computational class
its turing complete since any Bitwise Cyclic Tag program can be translated into 95-98 like this:
10 -> 0-0 1`-1 11 -> 0-0 0-2 0 -> 1-0 the program must also be encased by A-A
so the program:
10 11 11 0 11 10 0 11 10 11 0 with datastring 1
becomes:
A-A 0-0 1`-1 0-0 0-2 0-0 0-2 1-0 0-0 0-2 0-0 1`-1 1-0 0-0 0-2 0-0 1`-1 0-0 0-2 1-0 A-A
and the Collatz sequence:
10 11 10 10 10 11 0 11 10 10 0 11 10 10 11 10 10 11 10 10 0 0 0 0 ↕ 0-2 1`-1 1`-1 A-A 0-0 1`-1 0-0 0-2 10 0-0 1`-1 0-0 1`-1 0-0 0-2 1-0 0-0 0-2 0-0 1`-1 0-0 1`-1 1-0 11 0-0 1`-1 0-0 1`-1 0-0 0-2 0-0 1`-1 0-0 1`-1 0-0 0-2 0-0 1`-1 0-0 1`-1 1-0 1-0 1-0 1-0 A-A
note that the number of times 0-2 1`-1 1`-1(excluding the 0-2 in the first one) is the number of times 100 is added to the datastring