One-Instruction Cyclic Tag
| Paradigm(s) | imperative |
|---|---|
| Designed by | User:Ttulka |
| Appeared in | 2024 |
| Dimensions | one-dimensional |
| Computational class | Turing complete |
| Major implementations | Interpreter in JavaScript |
| Influenced by | Bitwise Cyclic Tag |
| File extension(s) | .oict |
One-Instruction Cyclic Tag (OICT) is an esoteric language for programming cyclic tag systems using just a single instruction. OICT is inspired by Bitwise Cyclic Tag and its alphabet is also composed solely of two symbols: 0 and 1.
All symbols other than 0 and 1, including whitespace, are ignored as comments.
OICT is Turing complete, as it can directly simulate any cyclic tag system, which has been proven to be universal.
Instruction TAG
The only instruction, TAG, used to define a production takes two arguments and has the following form:
1[1×n]0[(0|1)×n)]
Where n is a non-negative integer.
- The first argument, represented by the sequence of
1s following the initial1, defines the length of the production. - The second argument, the sequence of
0s and1s following the first0in the instruction, represents the production string.
Examples
Whitespaces are added for readability.
Production (101):
1 111 0 101
Productions (011, 10, 101):
1 111 0 011 1 11 0 10 1 111 0 101
Productions (1, ε, 0):
1 1 0 1 1 0 1 1 0 0
Debugging
Optionally, an interpreter might implement an additional DEBUG instruction, denoted by ;, which provides information about the current execution status, such as the current word and the computation step.
DEBUG is not a computation instruction, therefore it won't increase the step counter.
Example:
;11110011;111010;11110101
Initial word 1
Outputs (step: word)
0: 1, 1: 011, 2: 11, 3: 1101, 4: 101011, ...