...some examples of implementation (in Csouund) of the main algorithms used in algorithmic composition:
-
LONG RUN PROBABILITY AND DISTRIBUTION MODELS
-
DETERMINISTIC ALGORITHMS (RULE-BASED ALGORITHMS):
- FIBONACCI SEQUENCE
- COLLATZ CONJECTURE
- RECAMAN'S SEQUENCE
- PROBABILISTIC ALGORITHMS:
- MARKOV CHAIN
- MONTE CARLO METHOD ---> METROPOLIS AND METROPOLIS HASTINGS
- RANDOM WALK
- RANDOM WALK - LEVY FLIGHT
- FRACTALS:
- TRIANGLE, CARPET AND CURVE OF SIERPINSKY
- ESCAPE-TIME FRACTALS
- FRACTAL TREE
- NONLINEAR DYNAMIC SYSTEMS:
- LOGISTIC MAP
- STANDARD MAP
- HENON ATTRACTOR/MAP
- LORENZ ATTRACTOR
- ROSSLER ATTRACTOR
- GENERATIVE GRAMS:
- L-SYSTEM
- PATHFINDER
- A* SEARCH ALGORITHM
- CELLULAR AUTOMATA
- ELEMENTARY CELLULAR AUTOMATA (WOLFRAM CODE)
- CONWAY'S GAME OF LIFE
for any questions: mnlpql@gmail.com ©PasqualeMainolfi