TC
Jump to navigation
Jump to search
- This article is not detailed enough and needs to be expanded. Please help us by adding some more information.
- Not to be confused with Turing-complete.
This is TC in small bytes, data places have only two cells
| CM | DESC | EX | ID |
|---|---|---|---|
| * | flips the bit here | **** | 0000 |
| / | flips the data pointer | */*/ | 0001 |
| # | enter this cell and make another data place in it | */#*/#/#/#/*/# | 010 |
| @ | exit this cell | */#*@ | 0011 |
| ! | run one of these commands in binary using the cells in the data place | /#/#@@! (runs *) | 100 |
| ? | inputs one bit | ?* | 0101 |
| . | outputs one bit | ?. | 0110 |
| $ | run the whole code | ?.$ | 0111 |
| % | place the whole code but only until the nth commmand using the binary thing, but if no binary thing after, just do the whole code at this bit | %. (quine) | 1000 |
| ^ | run the code here | %^ (infinite loop) | 1001 |