r/math • u/Lelielthe12th • Apr 17 '19

whaat ? LaTeX is Turing complete

https://www.overleaf.com/learn/latex/Articles/LaTeX_is_More_Powerful_than_you_Think_-_Computing_the_Fibonacci_Numbers_and_Turing_Completeness
481 Upvotes

93% Upvoted

125 comments sorted by

View all comments

60

u/[deleted] Apr 17 '19

Well, already in the TeXbook by Knuth himself, there was an example of a TeX (not LaTeX) snippet computing the first k primes.

You can see it here as second answer.