I've heard that LaTeX is Turing complete. Are there any programs written in LaTeX?

Posted by ire_and_curses on Stack Overflow See other posts from Stack Overflow or by ire_and_curses
Published on 2010-06-03T17:39:29Z Indexed on 2010/06/03 17:44 UTC
Read the original article Hit count: 171

Filed under:

latex

|

turing-complete

It's possible to do interesting things with what would ordinarily be thought of as typesetting languages. For example, you can construct the Mandelbrot set using postscript.

It is suggested in this MathOverflow question that LaTeX may be Turing-complete. This implies the ability to write arbitrary programs (although it may not be easy!). Does anyone know of any concrete example of such a program in LaTeX, which does something highly unusual with the language?

© Stack Overflow or respective owner

Related posts about latex

How to deal with configuration style warnings occuring from TexLive 2012 installation?

as seen on Ask Ubuntu - Search for 'Ask Ubuntu'
I followed the advice of izx on how to install TexLive 2012 using the texlive-backports PPA. Before I started I removed all TexLive-related packages. The installation finished and everything seems to work fine. The only thing I noticed are some warnings in the output of the installer. Here is an excerpt… >>> More
Making the draft document option in LaTeX have extra text appear in LaTeX

as seen on Stack Overflow - Search for 'Stack Overflow'
Is there a way to get some text to appear only when the [draft] option is active. For example, when the draft option is active, I want some text to appear between my title and abstract: "draft: do not cite without permission" or some such. >>> More
how to replace latex macros with their definitions (using latex)

as seen on Stack Overflow - Search for 'Stack Overflow'
How can I replace all occurrence of user defined latex macros with their definitions? For example, given this file old.tex \newcommand{\blah}[2]{#1 \to #2} ... foo \blah{egg}{spam} bar ... how to generate the file below in an automatic way new.tex ... foo egg \to spam bar ... Instead of reimplementing… >>> More
write c++ in latex, noob latex question

as seen on Stack Overflow - Search for 'Stack Overflow'
maybe is a noob question but i can't find the solution in the web, i need to write C++ in Latex. I write C$++$ but the result is like crap, the signs are too big and there is too much space between C and the first plus sign. Previously i needed to write the sharp symbol for C#....c$\sharp$ it also… >>> More
fresh installation of PGF/TikZ crashes, why?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a clean CentOS 5.5 machine with tetex installed. Next, I installed PGF/TikZ: wget http://media.texample.net/pgf/builds/pgfCVS2010-06-02_TDS.zip unzip pgfCVS2010-06-02_TDS.zip \cp -r tex /usr/share/texmf texhash I'm trying to compile a simple document and this is what I'm getting: $ latex… >>> More

Related posts about turing-complete

Is CSS turing complete?

as seen on Stack Overflow - Search for 'Stack Overflow'
CSS isn't, insofar as I know, Turing complete. But my knowledge of CSS is very limited. Is CSS Turing complete? Are any of the existing draft or committees considering language features that might enable Turing completeness if it isn't right now? >>> More
Turing-Complete language possibilities?

as seen on Stack Overflow - Search for 'Stack Overflow'
In every Turing-Complete language, is it possible to create a working Compiler for itself which first runs on an interpreter written in some other language and then compiles it's own source code? (Bootstrapping) Standards-Compilant C++ compiler which outputs binaries for, e.g.: Windows? Regex Parser… >>> More
Code Golf: Shortest Turing-complete interpreter.

as seen on Stack Overflow - Search for 'Stack Overflow'
I've just tried to create the smallest possible language interpreter. Would you like to join and try? Rules of the game: You should specify a programming language you're interpreting. If it's a language you invented, it should come with a list of commands in the comments. Your code should start… >>> More
Practical non-Turing-complete languages?

as seen on Stack Overflow - Search for 'Stack Overflow'
Nearly all programming languages used are Turing Complete, and while this affords the language to represent any computable algorithm, it also comes with its own set of problems. Seeing as all the algorithms I write are intended to halt, I would like to be able to represent them in a language that… >>> More
What is Turing Complete?

as seen on Stack Overflow - Search for 'Stack Overflow'
What does the expression Turing Complete means? Can you give a simple explanation, without going into too much theoretical details? >>> More