Distance from profundo's apartment to the Arc = distance from butterbean's apartment to Twisted Bavarian
(1 1/2 blocks)
BSF's ability to hold down a chugged Mass = greebo's ability to ignore a cat toy without attacking
(30 seconds, max)
Kza's love for the simple, uncomplicated utopia = DW's love for the space race
(infininty)
You are viewing a low-graphics version of this page. Click the headline to view full version:
TT algorithms
Just a few. Do you know any?
Time roots normally spends on reading a post = attention span of a Honduran water moth
(.05 second)
(.05 second)
Katrina's knowledge of Munich, life the universe > the rest of TT put together
Ahhhhh... technically these do not qualify as algorithms, I think
Technically A=B is not a complex equation but I was leaving that to you engineering types.
QUOTE
In mathematics and computer science an algorithm (the word is derived from the name of the Persian mathematician Al-Khwarizmi), is a finite set of well-defined instructions for accomplishing some task which, given an initial state, will terminate in a corresponding recognizable end-state (contrast with heuristic). Algorithms can be implemented by computer programs, although often in restricted forms; mistakes in implementation and limitations of the computer can prevent a computer program from correctly executing its intended algorithm.
The concept of an algorithm is often illustrated by the example of a recipe, although many algorithms are much more complex; algorithms often have steps that repeat (iterate) or require decisions (such as logic or comparison) until the task is completed. Correctly performing an algorithm will not solve a problem if the algorithm is flawed or not appropriate to the problem. For example, a hypothetical algorithm for making a potato salad will fail if there are no potatoes present, even if all the motions of preparing the salad are performed as if the potatoes were there.
Different algorithms may complete the same task with a different set of instructions in more or less time, space, or effort than others. For example, given two different recipes for making potato salad, one may have peel the potato before boil the potato while the other presents the steps in the reverse order, yet they both call for these steps to be repeated for all potatoes and end when the potato salad is ready to be eaten.
The concept of an algorithm is often illustrated by the example of a recipe, although many algorithms are much more complex; algorithms often have steps that repeat (iterate) or require decisions (such as logic or comparison) until the task is completed. Correctly performing an algorithm will not solve a problem if the algorithm is flawed or not appropriate to the problem. For example, a hypothetical algorithm for making a potato salad will fail if there are no potatoes present, even if all the motions of preparing the salad are performed as if the potatoes were there.
Different algorithms may complete the same task with a different set of instructions in more or less time, space, or effort than others. For example, given two different recipes for making potato salad, one may have peel the potato before boil the potato while the other presents the steps in the reverse order, yet they both call for these steps to be repeated for all potatoes and end when the potato salad is ready to be eaten.
So the above are no algorithms but equations or statements.
A TT algorithm would be along the lines:
Define: TT'er
while(TT'er->breathing())
{
TT'er->wakesUp();
If(smoker) lightAcigarte()
OnWayToBathRoomTurnOnCoffeeMachine();
MakeCoffee();
TurnOnPC();
SurfToTT();
GoToSleep();
}
You are viewing a low fidelity version of this page. Click to view the full page.