From Esolang
Jump to navigation Jump to search

Implieses is a Zero Instruction Set Computer created by Calvin Games and rdococ on February 16, 2017. It is Turing complete because it is equivalent to a 2-tag system.


The computer state is a string of bits P.
P0 is the initial state.
If the first bit in Pn is 0 the computer halts and outputs the successive bits in Pn.
If the length of Pn is odd then 0 is added to the end of Pn.
The new state Pn+1 is the odd bits of Pn → the even bits of Pn.
The computer repeats this process until it halts.


Hello World! (Outputs the ASCII code for the string "Hello, world!")

Initial State:
0 01001000 01100101 01101100 01101100 01101111 00101100 00100000 01110111 01101111 01110010 01101100 01100100 00100001

XOR (Outputs a XOR b)

Initial State:
11111111 11111110 ab101110 1111ba10