:BASIC: [acronym, from Beginner's All-purpose Symbolic Instruction
Code] n. A programming language, originally designed for
Dartmouth's experimental timesharing system in the early 1960s,
which has since become the leading cause of brain-damage in
proto-hackers. This is another case (like {Pascal}) of the
cascading lossage that happens when a language deliberately
designed as an educational toy gets taken too seriously. A novice
can write short BASIC programs (on the order of 10--20 lines) very
easily; writing anything longer is (a) very painful, and (b)
encourages bad habits that will make it harder to use more powerful
languages well. This wouldn't be so bad if historical accidents
hadn't made BASIC so common on low-end micros. As it is, it ruins
thousands of potential wizards a year.
-- The AI Hackers Dictionary
Pascal n.
An Algol-descended language designed by
Niklaus Wirth on the CDC 6600 around 1967-68 as an instructional
tool for elementary programming. This language, designed primarily
to keep students from shooting themselves in the foot and thus
extremely restrictive from a general-purpose-programming point of
view, was later promoted as a general-purpose tool and, in fact,
became the ancestor of a large family of languages including
Modula-2 and Ada (see also bondage-and-discipline l
summed up by a devastating (and, in its deadpan way, screamingly
funny) 1981 paper by Brian Kernighan (of K&...
Turing tar-pit: n. 1. A place where anything is possible but
nothing of interest is practical. Alan Turing helped lay the
foundations of computer science by showing that all machines and
languages capable of expressing a certain very primitive set of
operations are logically equivalent in the kinds of computations
they can carry out, and in principle have capabilities that differ
only in speed from those of the most powerful and elegantly
designed computers....
Turing tar-pit n.
1. A place where anything is possible but
nothing of interest is practical. Alan Turing helped lay the
foundations of computer science by showing that all machines and
languages capable of expressing a certain very primitive set of
operations are logically equivalent in the kinds of computations
they can carry out, and in principle have capabilities that differ
only in speed from those of the most powerful and elegantly
designed computers....