// Algorithms
Algorithm is the technical term for the sequence of steps in a procedure that a computer program executes.
If you have a subpatch that adds 1 to an entered number, you could already consider this a (very simple) algorithm: this subpatch's algorithm is the addition of 1.
Random Numbers
A very simple but easy way to get the computer to operate on its own is by using a random generator.
here's how to apply limits to this random selection :
The result of a random generator follows the laws of probability. With random 6, every number from 0 to 5 has a probability of 1/6. Though highly improbable, it is possible that one of the numbers would never appear or wouldn't appear for a very long time. This probability can also be directly controlled. Here, the probability that a bang occurs on the left is 30 percent and 70 percent on the right:
Here's how to use random to control duration:
Recursion
When an algorithm runs and the result is continually fed back into the algorithm, that algorithm is said to be recursive.
One of the most well known examples of recursion that frequently occurs in music is the Fibonacci series. The algorithm is that the last two numbers in a list are added together to produce a next number in the list.
Source:http://www.pd-tutorial.com/english/