News for hackers. Stuff that matters.
Re:Proving the Turing Completeness of Fonts by peter_d_sherman on Monday March 11, 2019 @08:42PM (#19364357)
Excerpt: "Also, each mapping in the table acts as an “if” statement because it only executes if the pattern is matched."

This can be generalized as: Pattern Matching = if statement.

I don't know nor can I prove that that's true under all circumstances, however...

But, an interesting article.

There are no comments on this comment yet.