EtomemoteetomemoteetomemoteetomemotE
Jump to navigation
Jump to search
This language operates on memory by copying and flipping bits in a text file by User: A()
| Designed by | User: A() |
|---|---|
| Appeared in | 2025 |
| Computational class | , Low-level,Turing tarpits, Turing complete |
| Reference implementation | Unimplemented |
Commands
| Cmd | Action |
|---|---|
| _ | Copy bit to next bit |
| / | flip bit |
| \ | flip copy |
| : | copy flip |
| { | copy if last bit is 1 |
| } | copy if last bit is 0 |
| ( | move forwards |
| ) | move backwards |
| [ | jump forwards 3 in code if bit is 1 |
| ] | jump backwards 3 in code if bit is 1 |
| % | swap |
| B | copy flip move forwards |
| K | copy 3 bits over |
| X | end |
| > | shift bits forward |
| < | shift bits backward |
| - | 0 |
| ~ | 0 everything |
| . | output whole text file |
| O | nop |
Programs
Truth-machine
input: 11111111 11111111 11111111 11111111 11111111 11111111 11111111 Code: __B]
Hello World
Input 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 Code: (/(((/((( (\(((/(/( (\((\(((( (\((\(((( (\((\(/(/(/( ((/((((( (/(/(\(/( (\(((\(/(/(/( (\(/(((/(( (/(((/(((( (\((((/(( .X Mod.txt: 01001000 01100101 01101100 01101100 01101111 00100000 01010111 01101111 01110010 01101100 01100100