Cyclic Clockwise Rotating Contraption
Jump to navigation
Jump to search
| Designed by | User:RaiseAfloppaFan3925 |
|---|---|
| Appeared in | 2025 |
| Memory system | Cell tape, ring buffer-like |
| Computational class | Unknown |
| Reference implementation | Unimplemented |
| Influenced by | BF, Deadfish |
The Cyclic Clockwise Rotating Contraption or CCRC is a "machine system thing" by User:RaiseAfloppaFan3925. In CCRC, the program and memory are stored on a ring buffer-like structure that can expand and contract with the start and the end linked together. These rings rotate clockwise, and the speed of the rotation of the memory ring can be adjusted with instructions.
Memory
Each memory cell must be unsigned and of unbounded size.
Instructions
| Command | Action |
|---|---|
I
|
Takes in a UTF-32 character as input and overrides the current memory cell. |
O
|
Outputs the current cell as a UTF-32 character. |
[
|
Increase the speed of the memory ring's rotation by 1 cell per instruction |
]
|
Decrease the speed of the memory ring's rotation by 1 cell per instruction, the speed reaching 0 terminates the program |
i, d, s
|
Same as their Deadfish originals, respectively increments, decrements, and squares the current memory cell |
X
|
Removes the end of the memory ring. |
+
|
Pushes the sum of the start and the end cells after the end cell |
-
|
Pushes start - end after the end cell
|
(
|
Jumps to matching ) if current cell is 0
|
)
|
Jumps to matching ( if current cell is not 0
|
Examples
Cat program
Stops at EOF, requires EOF to be 0
I(OX[)o]
Infinite loop
Any program that doesn't contain an unbalanced ]
This is pretty weird lol because these are commands but don't really do anything
Truth Machine
This truth machine only accepts ASCII/Unicode codepoint 49 "1", everything else is treated as a 0
I[iisiiis[-(XXiisiiis(O))XXisiiisdO]]]