Dictionary De - En
De - Es
De - Pt| Proverbs, aphorisms, quotations (English) | by Linux fortune |
| SEMINAR ANNOUNCEMENT Title: Are Frogs Turing Compatible? Speaker: Don "The Lion" Knuth ABSTRACT Several researchers at the University of Louisiana have been studying the computing power of various amphibians, frogs in particular. The problem of frog computability has become a critical issue that ranges across all areas of computer science. It has been shown that anything computable by an amphi- bian community in a fixed-size pond is computable by a frog in the same-size pond -- that is to say, frogs are Pond-space complete. We will show that there is a log-space, polywog-time reduction from any Turing machine program to a frog. We will suggest these represent a proper subset of frog-computable functions. This is not just a let's-see-how-far-those-frogs-can-jump seminar. This is only for hardcore amphibian-computation people and their colleagues. Refreshments will be served. Music will be played. | |
| Welcome to UNIX! Enjoy your session! Have a great time! Note the use of exclamation points! They are a very effective method for demonstrating excitement, and can also spice up an otherwise plain-looking sentence! However, there are drawbacks! Too much unnecessary exclaiming can lead to a reduction in the effect that an exclamation point has on the reader! For example, the sentence Jane went to the store to buy bread should only be ended with an exclamation point if there is something sensational about her going to the store, for example, if Jane is a cocker spaniel or if Jane is on a diet that doesn't allow bread or if Jane doesn't exist for some reason! See how easy it is?! Proper control of exclamation points can add new meaning to your life! Call now to receive my free pamphlet, "The Wonder and Mystery of the Exclamation Point!"! Enclose fifteen(!) dollars for postage and handling! Operators are standing by! (Which is pretty amazing, because they're all cocker spaniels!) | |
| HOW TO PROVE IT, PART 4 proof by personal communication: 'Eight-dimensional colored cycle stripping is NP-complete [Karp, personal communication].' proof by reduction to the wrong problem: 'To see that infinite-dimensional colored cycle stripping is decidable, we reduce it to the halting problem.' proof by reference to inaccessible literature: The author cites a simple corollary of a theorem to be found in a privately circulated memoir of the Slovenian Philological Society, 1883. proof by importance: A large body of useful consequences all follow from the proposition in question. | |
