The Unix password encryption algorithm is designed to be computationally intensive in order to foil brute-force crack attacks, so although none of the logins succeeds; the overhead of rejecting them all can be substantial.
I/O or data structure manipulation routines, much less thealgorithm itself.
An algorithm is a specific procedure which one can apply to solve a complex computer problem; it is sort of a mathematical skeleton key.
Maybe the program was figuring out some new algorithm with which to conquer chess.
If we accept the hypothesis of the existence of a facility associated with image models (a hardware facility) to build an algorithm of generation of corellated information, then we could try to see if this facilty evolved in time or not.
If we have an acceptable difference (the sounds are considered corellated after modifying slightly the algorithm of generation of the sequence), then we can associate this to music.
Sometimes the algorithmgenerator is able to make a correct prediction of the sound which comes (a hit), sometimes not (a miss).
Such algorithm must be changed on and on, in a fast dynamical way, to predict better and better when the next sound will occur.
On the other hand, it seems that the symbolic models support the algorithm generator.
That is, the algorithm generator is better and better, but it acts on recorded data, which are a simplified copy of the external reality.
If the prediction fails, then the generator will modify the algorithm and continue to predict what follows.
This story-type model has elements generated by an algorithm generator.
This automatic activity of continuous modifying the generation algorithm can produce a positive state of mind, which can be called pleasure.
The generating algorithm is able to build in a dynamically way the elements which will be recorded by this special type story-type model.
My example of mile-to-kilometer conversion would be patentable subject matter but, we hope, no patent would be granted because the algorithmis not novel and is obvious.
The line between idea or algorithm on the one hand and patentable machine on the other looks nice and easy.
Say, for example, that algorithm was the process for converting miles into kilometers and vice versa.
Yet the ability to couple the abstract algorithm with the concept of a Turing machine undermines this conception.
Routing Routing is thealgorithm by which a network directs a packet from its source to its destination.
So, you must design an algorithm to pass around time between nodes over the network links where the delay in transmission can only be approximated.
