Fractran Enter the program as a list of comma separated fractions. Then enter the first value for n. This is theoretical turing completeness because of the limited number precision of scratch, some programs wont work as intended. Example programs: Addition of 2 numbers (3/2) Multiplication of 2 numbers (455/33,11/13,1/11,3/7,11/2,1/3) John Conway's prime generating program (17/91, 78/85, 19/51, 23/38, 29/33, 77/29, 95/23, 77/19, 1/17, 11/13, 13/11, 15/2, 1/7, 55/1) Input has to be 2
https://en.wikipedia.org/wiki/FRACTRAN
