Tiny Turing-completeness
+0
−1
Your challenge today is to golf a program to interpret something Turing-complete.
You may use any Turing-complete system for this so long as it is not the source language of the challenge - even a Turing-complete subset of the emulated language. You may not directly evaluate code using a builtin within the language. An explanation is not required, but would be nice to have, especially for programs featuring no I/O.
An example program would be this Python program to compute the next step of the input (a string made of 0s and 1s) in Rule 110, created by Redstoneboi:
cells=f'00{input()}0'
print(''.join(['01110110'[int(cells[i:i+3],2)]for i in range(len(cells)-2)]))
This challenge is scored in characters: shortest program wins. Have fun!
0 answers
1 comment thread