Bitdeque

From Esolang
Jump to: navigation, search

Bitdeque is an Esoteric programming language created by user:Nobody in 2019. It operates on a Deque of bits and a register. Currently there is no interpreter for Bitdeque.

Overview

Bitdeque operates on a Deque of bits and a register. When the program starts, the Deque is empty and the value in the register is 0. There is (currently) no I/O.

Instructions

Bitdeque has 6 instructions:

  1. Push the bit in the register to the right side of the Deque (Does not change the bit in the register)
  2. Push the bit in the register to the left side of the Deque (Does not change the bit in the register)
  3. Pop the bit from the left side of the Deque to the register (This removes the bit on the left. The register becomes 0 if the Deque is empty)
  4. Pop the bit from the right side of the Deque to the register (This removes the bit on the right. The register becomes 0 if the Deque is empty)
  5. Invert the bit in the register
  6. This is the only operation which takes a parameter. Take a number N (specified in the program) and go to the N'th operation in the program if the bit in the register is 1.

Examples

Since Bitdeque is currently only a very abstract idea, there can't be any examples.

Implementation

user:Nobody is currently writing an interpreter for this.

Computational Class

According to user:Camto, Bitdeque is Turing-complete, because with a 0 in the middle and 1's on the left and right, one can simulate a Minsky Machine with 2 registers, which is Turing-complete.