OK, I haven't been blogging much lately, but seeing this quote on /. I just had to.
Beware of the Turing Tar-pit in which everything is possible but nothing of interest is easy.

I should have recognized this. A little googling revealed that it is one of Alan Perlis' beautiful epigrams.
The epigram summarises very nicely my research and in fact any research in programming languages. All interesting properties about programs turn out to be undecidable. This might seem like bad news. But I wouldn't be so fast. This is precisely what makes my field of research exciting. Instead of finding the exact answer we have to find good approximations which can be computed in reasonable time.

It seems that the term "Turing Tar-pit" has a pretty interesting meaning nowadays. Quoting from answers.com:
A Turing tarpit is a programming language designed to be Turing-complete while minimizing the number of distinct instructions. Such a language gives up practicality (such as ease of coding, performance, etc.) but is often useful in theoretical computer science.

No comments: