| ▲ | marmakoide 9 hours ago | ||||||||||||||||||||||
Having something Turing-complete is surprisingly easy, and it hides everywhere. The repository have a small document that explains how you can use printf() as a computer : it can performs additions, logical union and negation, which is enough. It was unintentional, but Ken Thompson being Ken Thompson, can't be 100% sure. | |||||||||||||||||||||||
| ▲ | gwern an hour ago | parent | next [-] | ||||||||||||||||||||||
List of examples: https://gwern.net/turing-complete It was probably unintentional, yeah, I don't recall any mentions of early printf being overloaded to do stuff, nor is it clear why you would do that since you're using it in a much more convenient Turing-complete language already (C). | |||||||||||||||||||||||
| ▲ | danbruc 8 hours ago | parent | prev [-] | ||||||||||||||||||||||
So there was no extension of the functionality over time, all the formats have been supported from day one? | |||||||||||||||||||||||
| |||||||||||||||||||||||