|
|
|
|
|
|
|
Classic, the Simpsons, and the occasional cheesy old swashbuckler movie. 2. [IBM] To send a copy of something to someone else's terminal. "Tube me that note?" |
|
|
|
|
|
|
|
|
tube time n. Time spent at a terminal or console. More inclusive that hacking time; commonly used in discussions of what parts of one's environment one uses most heavily. "I find I'm spending too much of my tube time reading mail since I started this revision." |
|
|
|
|
|
|
|
|
tunafish n. In hackish lore, refers to the mutated punchline of an age-old joke to be found at the bottom of the manual pages of tunefs(8) in the original BSD 4.2 distribution. The joke was removed in later releases once commercial sites started using 4.2. Tunefs relates to the 'tuning' of file-system parameters for optimum performance, and at the bottom of a few pages of wizardly inscriptions was a 'BUGS' section consisting of the line "You can tune a file system, but you can't tunafish". Variants of this can be seen in other BSD versions, though it has been excised from some versions by humorless management droids. The [nt]roff source for SunOS 4.1.1 contains a comment apparently designed to prevent this: "Take this out and a Unix Demon will dog your steps from now until the time_t's wrap around." |
|
|
|
|
|
|
|
|
[It has since been pointed out that indeed you can tunafish. Usually at a canning factory ESR] |
|
|
|
|
|
|
|
|
tune vt. [from automotive or musical usage] To optimize a program or system for a particular environment, esp. by adjusting numerical parameters designed as hooks for tuning, e.g., by changing #define lines in C. One may tune for time (fastest execution), tune for space (least memory use), or tune for configuration (most efficient use of hardware). See bum, hot spot, hand-hacking. |
|
|
|
|
|
|
|
|
turbo nerd n. See computer geek. |
|
|
|
|
|
|
|
|
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. However, no machine or language exactly matching Turing's primitive set has ever been built (other than possibly as a classroom exercise), because it would be horribly slow and far too painful to use. |
|
|
|
|
|