INTERCAL
From Just Solve the File Format Problem
(Difference between revisions)
Dan Tobias (Talk | contribs) |
Dan Tobias (Talk | contribs) |
||
| Line 5: | Line 5: | ||
}} | }} | ||
| − | '''INTERCAL''' is a programming language which was created in 1972 as a parody. Its constructs are designed to be maximally obtuse and incomprehensible, with statements such as '''PLEASE GIVE UP''' (which terminates the program). Later versions added the infamous '''COME FROM''' statement, the inverse of the more common '''GO TO''' (which was "considered harmful" in a [http://www.u.arizona.edu/~rubinson/copyright_violations/Go_To_Considered_Harmful.html famous computer science paper]). | + | '''INTERCAL''' is a programming language which was created in 1972 as a parody. Its constructs are designed to be maximally obtuse and incomprehensible, with statements such as '''PLEASE GIVE UP''' (which terminates the program), '''WRITE IN''' (which accepts input), and '''READ OUT''' (which generates output). Later versions added the infamous '''COME FROM''' statement, the inverse of the more common '''GO TO''' (which was "considered harmful" in a [http://www.u.arizona.edu/~rubinson/copyright_violations/Go_To_Considered_Harmful.html famous computer science paper]). |
The language is actually Turing-complete, and hence capable of implementing any algorithm, though the programmer might be driven into advanced stages of insanity from the attempt. | The language is actually Turing-complete, and hence capable of implementing any algorithm, though the programmer might be driven into advanced stages of insanity from the attempt. | ||
Revision as of 04:43, 21 December 2012
INTERCAL is a programming language which was created in 1972 as a parody. Its constructs are designed to be maximally obtuse and incomprehensible, with statements such as PLEASE GIVE UP (which terminates the program), WRITE IN (which accepts input), and READ OUT (which generates output). Later versions added the infamous COME FROM statement, the inverse of the more common GO TO (which was "considered harmful" in a famous computer science paper).
The language is actually Turing-complete, and hence capable of implementing any algorithm, though the programmer might be driven into advanced stages of insanity from the attempt.
