Turing tarpit

A Turing tarpit (or Turing tar-pit) is any programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks.[1] The phrase was coined in 1982 by Alan Perlis in the Epigrams on Programming:[2]

54. Beware of the Turing tar-pit in which everything is possible but nothing of interest is easy.

In any Turing complete language, it is possible to write any computer program, so in a very rigorous sense nearly all programming languages are equally capable. Showing that theoretical ability is not the same as usefulness in practice, Turing tarpits are characterized by having a simple abstract machine that requires the user to deal with many details in the solution of a problem.[3] At the extreme opposite are interfaces which can perform very complex tasks with little human intervention but become obsolete if requirements change slightly.

Some esoteric programming languages, such as Brainfuck, are specifically referred to as "Turing tarpits"[4] because they deliberately implement the minimum functionality necessary to be classified as Turing complete languages. Using such languages is a form of mathematical recreation: programmers can work out how to achieve basic programming constructs in an extremely difficult but mathematically Turing-equivalent language.[5]

See also

References

  1. ↑ "Turing Tarpit". c2.com. 10 March 2010. Retrieved 7 November 2012.
  2. ↑ Perlis, A (September 1982). "Epigrams on Programming". ACM SIGPLAN Notices. Yale University. 17 (9): 7–13. doi:10.1145/947955.1083808. Archived from the original on 1996-03-26. Retrieved 28 August 2015.
  3. ↑ "Exploring the depths of a Turing tarpit". practicingruby.com. 7 February 2013.
  4. ↑ Chandra, V (2014). Geek Sublime: The Beauty of Code, the Code of Beauty. Graywolf Press. ISBN 9781555973261. Retrieved 28 August 2015.
  5. ↑ Esoteric Topics in Computer Programming, Cat's Eye Technologies, Canada. ("They present the programmer with the challenge, intrigue, and entertainment of looking at known algorithms and concepts in a whole new light.")

Further reading

This article is issued from Wikipedia - version of the 11/3/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.