4 ms·
Imagine a language that not only doesn't have booleans, it only has positive fractions. It also doesn't have any keywords, yet it is Turing-complete. Strugglin
by seanhunter 1y ago
Imagine a language that not only doesn't have booleans, it only has positive fractions. It also doesn't have any keywords, yet it is Turing-complete.
Struggling to imagine it? Don't worry. John H Conway has done it for you.
https://en.wikipedia.org/wiki/FRACTRAN https://en.wikipedia.org/wiki/FRACTRAN
- entaloneralie 1y agoIn FRACTRAN, Bools is all you get. The value is 6 is a:true, b:true, c: false, d: false, etc.. I love fractran tho, I must have written a thousand lines of it this year alone.